It is easy to determine whether a given integer is prime

DOI10.1090/S0273-0979-04-01037-7zbMath1110.11002OpenAlexW2044920338WikidataQ27940963 ScholiaQ27940963MaRDI QIDQ4829920

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

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

Related Items (7)

Lower bounds on the orders of subgroups connected with Agrawal conjecture ⋮ Expander graphs and their applications ⋮ Interactions of computational complexity theory and mathematics ⋮ Cyclotomy and the heptadecagon ⋮ Elements of high order in finite fields of the form ⋮ A generalization of Miller’s primality theorem ⋮ Congruences for sums of binomial coefficients

Cites Work

• On some subgroups of the multiplicative group of finite rings
• On distinguishing prime numbers from composite numbers
• Théorème de Brun-Titchmarsh; application au théorème de Fermat
• Primality testing and Abelian varieties over finite fields
• There are infinitely many Carmichael numbers
• PRIMES is in P
• Proving primality in essentially quartic random time
• New directions in cryptography
• Sharpening ``Primes is in P for a large family of numbers
• On the number of primes p for which p+a has a large prime factor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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