Euclidean primes have the minimum number of primitive roots

zbMATH Open1162.11007MaRDI QIDQ3609007FDOQ3609007

Authors: Michal Křížek, Lawrence Somer 

Publication date: 6 March 2009

Full work available at URL: http://pphmj.com/abstract/3616.htm

Recommendations

• Prime numbers in certain arithmetic progressions
• Primes in certain arithmetic progressions
• Euclid's theorem redux
• Euclid's proof of the infinitude of prime numbers.
• Euclid's Argument on the Infinitude of Primes

zbMATH Keywords

Dirichlet's theoremprimitive rootsEuclidean primes

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Primes (11A41)

Cited In (1)

• On remarkable properties of primes near factorials and primorials

This page was built for publication: Euclidean primes have the minimum number of primitive roots

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