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
Parents
43
D. H. Lehmer · Bulletin of the American Mathematical Society · 1932 · 109 citations · Full text
A New Banach Space Defined By Euler Totient Matrix Operator
Merve İlkhan, Emrah Evren Kara · Operators and Matrices · 2019 · 80 citations · Full text
The Ramanujan Journal · 1998 · 76 citations
1–5 of 43
68
3
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 68
46
The University of Texas at Austin
Austin, United States
3 h-index
3 publications
144 citations
Düzce Üniversitesi
Düzce, Türkiye
2 h-index
3 publications
79 citations
Universidad Nacional Autónoma de México
Mexico City, Mexico
2 h-index
2 publications
24 citations

Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
1 h-index
1 publications
11 citations
University of South Florida
Tampa, United States
1 h-index
1 publications
17 citations

Kazan Federal University
Kazan’, Russia
1 h-index
3 publications
39 citations
Muscular Dystrophy Canada
Toronto, Canada
1 h-index
1 publications
12 citations
Yonsei University
Seoul, South Korea
1 h-index
2 publications
40 citations
1–8 of 46
3 publications · 38 citations
3
h-index
3 publications · 31 citations
3
h-index
IJNT · 2 publications · 40 citations
2
h-index
2 publications · 139 citations
2
h-index
2 publications · 29 citations
2
h-index
1–5