Jordan Totient Function

The Jordan Totient Function is a multiplicative arithmetic function that generalizes Euler’s totient function by counting the number of k-tuples of positive integers less than or equal to a given integer n that form a coprime tuple with n.

8

Publications

618

Citations

11

Authors

7

Institutions

Publications per year

2017–2026

1

Variants

Jordan's Totient Function

Authors

11

  1. AV
    A. Vourdas

    University of Liverpool, United Kingdom

    2 publications · 37 citations

    2

    h-index

  2. CB
    Cyril Banderier

    Centre National de la Recherche Scientifique, France

    2 publications · 37 citations

    2

    h-index

  3. IN
    I. N. Herstein

    University of Chicago, United States

    2 publications · 502 citations

    2

    h-index

  4. SD
    Sukumar Das Adhikari

    Harish-Chandra Research Institute, India

    1 publications · 12 citations

    1

    h-index

  5. BN
    B. N. Swami

    Swami Keshwanand Rajasthan Agricultural University, India

    1 publications · 12 citations

    1

    h-index

1–5 of 11

Venues

  1. 2

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 2 publications · 502 citations

    2

    h-index

  3. Procedia Technology

    1 publications · 12 citations

    1

    h-index

  4. Mathematical Methods in the Applied Sciences

    1 publications · 27 citations

    1

    h-index

  5. Journal of Number Theory

    1 publications · 12 citations

    1

    h-index

1–5