The Euclidean algorithm for number fields and primitive roots

DOI10.1090/S0002-9939-2012-11327-9zbMath1309.11005MaRDI QIDQ4911555

Kathleen L. Petersen, M. Ram Murty

Publication date: 19 March 2013

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

zbMATH Keywords

Artin's conjectureprimitive rootslarge sieveEuclidean algorithmEuclidean rings

Mathematics Subject Classification ID

Other number fields (11R21) Applications of sieve methods (11N36) Congruences; primitive roots; residue systems (11A07)

Related Items

Unnamed Item ⋮ On Euclidean ideal classes in certain abelian extensions ⋮ Lenstra-Hurwitz cliques and the class number one problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on Artin's conjecture
• Units in residue classes
• Euclidean algorithm in small abelian fields
• About Euclidean rings
• A Bombieri-Vinogradov theorem for all number fields
• Counting cusps of subgroups of $\mathrm {PSL}_2(\mathcal {O}_K)$
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• Rosser's sieve
• ℤ[ is Euclidean]
• Euclidean Rings of Algebraic Integers