Euler's Totient Function

Euler's Totient Function is a number-theoretic function that counts the positive integers up to a given integer \( n \) that are relatively prime to \( n \), serving as a fundamental tool in modular arithmetic for determining the order of multiplicative groups modulo \( n \).

43

Publications

1.3K

Citations

68

Authors

46

Institutions

Publications per year

2017–2026

10

Variants

Euler's Phi Function

Authors

68

  1. Mİ
    Merve İlkhan

    Düzce Üniversitesi, Türkiye

    3 publications · 137 citations

    3

    h-index

  2. EE
    Emrah Evren Kara

    Düzce Üniversitesi, Türkiye

    2 publications · 102 citations

    2

    h-index

  3. DH
    D. H. Lehmer

    University of California, Berkeley, United States

    1 publications · 109 citations

    1

    h-index

  4. QT
    Qifu Tyler Sun

    University of Science and Technology Beijing, China

    1 publications · 20 citations

    1

    h-index

  5. BR
    Bhooshan Rajpathak

    Visvesvaraya National Institute of Technology, India

    1 publications · 12 citations

    1

    h-index

1–5 of 68

Venues

  1. Bulletin of the London Mathematical Society

    3 publications · 38 citations

    3

    h-index

  2. American Mathematical Monthly

    3 publications · 31 citations

    3

    h-index

  3. International Journal of Number Theory

    IJNT · 2 publications · 40 citations

    2

    h-index

  4. Bulletin of the American Mathematical Society

    2 publications · 139 citations

    2

    h-index

  5. Journal of Number Theory

    2 publications · 29 citations

    2

    h-index

1–5