Scribd
Upload
142 views2 pages

Fermat Little Theorem

Fermat's little theorem states that for any prime number p and natural number a, ap - a is divisible by p. This can be written as ap ≡ a (mod p). The theorem is proved using two lemmas: 1) pCk is divisible by p for 0 < k < p. 2) (1+m)p - (1+m)p is divisible by p. The main theorem is then proved by mathematical induction, showing that if the statement holds for some natural number a, then it also holds for a+1. Therefore, by induction, the theorem is true for all natural numbers a.

Uploaded by

rootkit5678
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
142 views2 pages

Fermat Little Theorem

Fermat's little theorem states that for any prime number p and natural number a, ap - a is divisible by p. This can be written as ap ≡ a (mod p). The theorem is proved using two lemmas: 1) pCk is divisible by p for 0 < k < p. 2) (1+m)p - (1+m)p is divisible by p. The main theorem is then proved by mathematical induction, showing that if the statement holds for some natural number a, then it also holds for a+1. Therefore, by induction, the theorem is true for all natural numbers a.

Uploaded by

rootkit5678
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Fermat’s little theorem:

The theorem states that a p−a is divisible by p where a , p ∈ ℕ and p is a prime


number. Meaning a p ≡ a mod p

In order to prove the theorem, we need to prove the following lemmas:

Lemma no 1: pC r is divisible by p where 0 < r < p

The above lemma can also be written in this following format:


p
Ck p
=β k ⇒ C k =β k p where β k is a natural number
p
we know that, prime numbers are not divisible by any smaller natural numbers
other than 1.
p p

p p!
∏
i=1
i ∏
i= p−k +1
i
( p−k +1)( p−k +2)...( p−1) p
since, C k = = k p−k
= k
=
k ! ( p−k )! 1×2×3×...×k
∏ i×∏ i ∏i
i=1 i=1 i=1
Since k < p, no numbers from 1 to k can divide the “bold” p in the fraction unless
k = p. We also know, pC p = p C p− p= pC 0=1 . That’s why if k = 0 or k = p, pC k is not
divisible by p. Hence the lemma is true.

Lemma no 2: (1+m)p −(1+m p ) is divisible by p

The above lemma can also be written in this following format:


p p
(1+m) −(1+m ) p p
=γ ⇒(1+m) −(1+m )=γp where γ is a natural number.
p
p
From “binomial theorem”, we know that, (1+m) =∑ ( pC k mk ) p

k=0
p−1 p−1
p 0 p k p p k p p
= C 0 m + ∑ ( C k m )+ C p m =1+ ∑ ( β k p m )+m [ ∵ C k = β k p from lemma 1]
k =1 k=1
p−1 p−1 p−1
p k p k p k
=(1+m )+ ∑ (β k p m )=(1+m )+ p ∑ ( β k m ) ⇒(1+m)p −(1+m )= p ∑ ( β k m )
k=1 k=1 k =1
p−1
p k
∴(1+m)p −(1+m )= pγ [ here ∑ ( β k m )=γ ]
k=1
p−1
Since ∑ ( β k m k ) is a natural number, it can be treated as γ. Hence the lemma is
k=1
proved.

The main theorem:

If a = 1 then 1 p −1=1−1=0=0× p . Here q = 0


∴ The statement is true for a = 1 .

If a = m then assume the following statement to be true:


p
m −m p
=q m ⇒ m −m=q m p where q m is a natural number.
p
Now, (m+1)p −(m+1)=(1+m) p−(1+m p )+(1+mp )−(m+1)
p p p (m+1) p−(m+1)
={(1+m) −(1+m )}+(m −m)= pγ +q m p= p (γ +q m) ⇒ =γ +qm
p

∴ The statement is true for a = m + 1 if it is true for a = m .


∴ The theorem is proved according to the mathematical induction rule.

You might also like