Primitive Root Theorem
The Primitive Root Theorem is a fundamental result in number theory that establishes the conditions under which a finite multiplicative group of integers modulo n admits a primitive root, thereby guaranteeing the existence of a generator for the group when n is 1, 2, 4, p^k, or 2p^k, where p is an odd prime and k is a positive integer.
67
Publications
2.8K
Citations
83
Authors
59
Institutions
Publications per year
2017–2026
1
Variants
Gauss's Primitive Root Theorem
Parents
67
ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
D. R. Heath‐Brown · The Quarterly Journal of Mathematics · 1986 · 286 citations
Primitive normal bases for finite fields
H. W. Lenstra, René Schoof · Mathematics of Computation · 1987 · 128 citations · Full text
Coding the Lehmer pseudo-random number generator
William H. Payne, John Rabung, T. P. Bogyó · Communications of the ACM · 1969 · 123 citations · Full text
1–5 of 67
83
4
h-index
University of Illinois Urbana-Champaign, United States
4 publications · 68 citations
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 83
59
Max Planck Institute for Mathematics
Bonn, Germany
3 h-index
3 publications
71 citations

McGill University
Montreal, Canada
3 h-index
4 publications
124 citations
Princeton University
Princeton, United States
2 h-index
3 publications
60 citations

University of Glasgow
Glasgow, United Kingdom
2 h-index
2 publications
41 citations

Polish Academy of Sciences
Warsaw, Poland
2 h-index
2 publications
22 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
109 citations
Leiden University
Leiden, The Netherlands
2 h-index
3 publications
83 citations

Romanian Academy
Bucharest, Romania
2 h-index
4 publications
52 citations
1–8 of 59
MCOM · 9 publications · 261 citations
9
h-index
4 publications · 102 citations
4
h-index
TRAN · 4 publications · 124 citations
4
h-index
3 publications · 54 citations
3
h-index
3 publications · 368 citations
3
h-index
1–5