Codex Wiki
OurBigBook.com
Site
Source code
Fermat-Euler theorem
Home
Mathematics
Area of mathematics
Number theory
OurBigBook.com
Words: 44
Articles: 1
If
g
cd
(
a
,
n
)
=
1
, then
a
ϕ
(
n
)
≡
1
(
mod
n
)
. For prime
n
=
p
, this yields Fermat's little theorem.
Table of contents
44
1
Generalized repunit pseudoprime construction
Fermat-Euler theorem
28
Ancestors
(4)
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(2)
Solution
Solution