Euler's Theorem
Euler's Theorem is a fundamental theorem in number theory that generalizes Fermat's Little Theorem by stating that for any integer \( a \) coprime to a positive integer \( n \), \( a^{\phi(n)} \equiv 1 \pmod{n} \), where \( \phi(n) \) is Euler's totient function.
216
Publications
7.7K
Citations
283
Authors
178
Institutions
Publications per year
2017–2026
23
Variants
Euler's Totient Theorem
Parents
216
Alfred van der Poorten, R. Apéry · The Mathematical Intelligencer · 1979 · 276 citations
Eulerian Numbers and Polynomials
L. Carlitz · Mathematics Magazine · 1959 · 224 citations
Raymond Ayoub · American Mathematical Monthly · 1974 · 223 citations
Some Properties of Unitary Cayley Graphs
Walter Klotz, Torsten Sander · The Electronic Journal of Combinatorics · 2007 · 174 citations · Full text
1–5 of 216
283
6
h-index
5
h-index
5
h-index
4
h-index
3
h-index
1–5 of 283
178

Pennsylvania State University
State College, United States
7 h-index
7 publications
478 citations

Macquarie University
Sydney, Australia
4 h-index
4 publications
332 citations

Hungarian Academy of Sciences
Budapest, Hungary
4 h-index
4 publications
97 citations
The University of Texas at Austin
Austin, United States
3 h-index
3 publications
144 citations
Universidad Nacional Autónoma de México
Mexico City, Mexico
3 h-index
4 publications
190 citations
Tokyo Institute of Technology
Tokyo, Japan
3 h-index
4 publications
122 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
101 citations

University of Toronto
Toronto, Canada
3 h-index
3 publications
52 citations
1–8 of 178
18 publications · 927 citations
16
h-index
13 publications · 319 citations
11
h-index
9 publications · 243 citations
9
h-index
9 publications · 563 citations
9
h-index
MCOM · 8 publications · 314 citations
8
h-index
1–5