Amanote Research

Amanote Research

    RegisterSign In

Very Short Primality Proofs

Mathematics of Computation - United States
doi 10.2307/2007892
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
Date

January 1, 1987

Authors
Carl Pomerance
Publisher

JSTOR


Related search

Two Short Proofs Concerning Tree-Decompositions

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2002English

Short Proofs of the Kneser-Lovász Coloring Principle

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2018English

Primality Test

American Journal of Computational Mathematics
2013English

Two Short Proofs of the Perfect Forest Theorem

Theory and Applications of Graphs
CombinatoricsNumerical AnalysisTheoretical Computer ScienceDiscrete Mathematics
2017English

Catholicism: A Very Short Introduction

2017English

Education: A Very Short Introduction

Choice Reviews Online
2014English

Journalism: A Very Short Introduction

2014English

On Fast Heuristic Non-Deterministic Algorithms and Short Heuristic Proofs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Geoffrey Chaucer: A Very Short Introduction

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy