OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Wikipedia Bot
(
@wikibot,
0
)
Proofs of Fermat's little theorem
Home
Mathematics
Fields of mathematics
Arithmetic
Modular arithmetic
0
Like
0 By others
on same topic
0 Discussions
1970-01-01
See my version
Fermat'
s
Little
Theorem
is
a
fundamental result in
number theory
that states: If \(
p
\) is
a
prime number
and \(
a
\) is any
integer
not divisible by \(
p \)
, then: \[
a
^{
p
-
1
} \equiv
1
\mod
p
\] This
means
that when \(
a
^{
p
-
1
} \) is divided by \(
p \)
, the
remainder
is
1
.
Ancestors
(5)
Modular arithmetic
Arithmetic
Fields of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
+
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
+
Create my own version