It is easy to determine whether a given integer is prime

DOI10.1090/S0273-0979-04-01037-7MaRDI QIDQ4829920zbMATH OpenOpenAlexWikidataFDO

Authors Andrew Granville

Publication date 1 December 2004

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0273-0979-04-01037-7

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Polynomials over finite fields (11T06) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Sequences (mod (m)) (11B50) Distribution of integers with specified multiplicative constraints (11N25) Primes (11A41) Factorization; primality (11A51) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 2066372
• Decision problem \texttt{PRIMES}
• scientific article; zbMATH DE number 6308078
• scientific article; zbMATH DE number 2115053
• scientific article; zbMATH DE number 4103163

Cites work

• scientific article; zbMATH DE number 1258344 (Why is no real title available?)
• scientific article; zbMATH DE number 1465089 (Why is no real title available?)
• scientific article; zbMATH DE number 2115025 (Why is no real title available?)
• scientific article; zbMATH DE number 861252 (Why is no real title available?)
• scientific article; zbMATH DE number 903684 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• New directions in cryptography
• On distinguishing prime numbers from composite numbers
• On some subgroups of the multiplicative group of finite rings
• On the number of primes p for which p+a has a large prime factor
• PRIMES is in P
• Primality testing and Abelian varieties over finite fields
• Proving primality in essentially quartic random time
• Sharpening ``Primes is in P for a large family of numbers
• There are infinitely many Carmichael numbers
• Théorème de Brun-Titchmarsh; application au théorème de Fermat

Cited in

(10)

• Elements of high order in finite fields of the form
• Cyclotomy and the heptadecagon
• Lower bounds on the orders of subgroups connected with Agrawal conjecture
• Mathematical Certificates
• What is the smallest prime?
• Interactions of computational complexity theory and mathematics
• A generalization of Miller’s primality theorem
• Congruences for sums of binomial coefficients
• Expander graphs and their applications
• Cyclemaster matrices and primality testing

This page was built for publication: It is easy to determine whether a given integer is prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829920)