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

Authors

83

  1. LC
    L. Carlitz

    Duke University, United States

    4 publications · 145 citations

    4

    h-index

  2. AZ
    Alexandru Zaharescu

    University of Illinois Urbana-Champaign, United States

    4 publications · 68 citations

    4

    h-index

  3. PM
    Pieter Moree

    Max Planck Institute for Mathematics, Germany

    3 publications · 100 citations

    3

    h-index

  4. KS
    Kenneth S. Williams

    Carleton University, Canada

    2 publications · 48 citations

    2

    h-index

  5. HW
    H. W. Lenstra

    University of California, Berkeley, United States

    2 publications · 157 citations

    2

    h-index

1–5 of 83

Venues

  1. Mathematics of Computation

    MCOM · 9 publications · 261 citations

    9

    h-index

  2. Journal of Number Theory

    4 publications · 102 citations

    4

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 4 publications · 124 citations

    4

    h-index

  4. Canadian Journal of Mathematics

    3 publications · 54 citations

    3

    h-index

  5. The Quarterly Journal of Mathematics

    3 publications · 368 citations

    3

    h-index

1–5