Scribd
Upload
123 views2 pages

Fermat LittleTheorem

good theorem

Uploaded by

thorgod94150
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
123 views2 pages

Fermat LittleTheorem

good theorem

Uploaded by

thorgod94150
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

Math 455.

1 April 4, 2009

Fermats Little Theorem


For the RSA encryption system, we shall need the following result
Theorem 1 (Fermats Little Theorem). Let p be a prime. Then for each integer
a not divisible by p,
ap1 1 (mod p).
Proof. Let a be an integer for which p a.
For each j = 1, 2, . . . , p 1, let
rj = (j a) mod p,
so that 0 rj < p, that is, 0 rj p 1.
We are going to prove that (r1 , r2 , . . . , rp1 ) is a permutation of (1, 2, . . . , p 1).
For each j = 1, 2, 3, . . . , p 1, we have j a 6 0 (mod p) (why?), that is, rj 6= 0.
Thus r1 , r2 , . . . , rp1 all belong to the set {1, 2, 3, . . . , p 1}.
Next, if 1 j, k p1 with j 6= k, then rj 6= rk . (Why?) Thus {r1 , r2 , . . . , rp1 }
is a set of p 1 numbers that is a subset of the set {1, 2, 3, . . . , p 1}. Hence these
two sets are the same:
{r1 , r2 , . . . , rp1 } = {1, 2, 3, . . . , p 1}
Since both sets have p 1 elements, then (r1 , r2 , . . . , rp1 ) is a permutation of
(1, 2, . . . , p 1).
In other words, each of the p 1 numbers a, 2 a, 3 a, . . . , (p 1)a is congruent
modulo p to exactly one of the p 1 numbers 1, 2, 3, . . . , p 1. Hence

a (2 a) (3 a) (p 1) a 1 2 3 (p 1) (mod p).
In other words,
(p 1)! ap1 (p 1)! (mod p).

(*)

Now each of the factors 1, 2, 3, . . . , p 1 of (p 1)! is relatively prime to p and so, by


the Congruence Cancellation Law, may be cancelled from both sides of (*). After
the cancellations, what remains is
ap1 1 (mod p),
as desired.
The following corollary is, in fact, equivalent to Fermats Little Theorem.
Corollary 1. Let p be a prime. The for every integer a,
ap a (mod p).
Fermats Little Theorem may be used to calculate efficiently, modulo a prime,
powers of an integer not divisible by the prime.

Example 1. Calculate 2345 mod 11 efficiently using Fermats Little Theorem.


Solution. The number 2 is not divisible by the prime 11, so
210 1 (mod 11)
by Fermats Little Theorem. By the division algorithm,
345 = 34 10 + 5.
Since 2345 = 23410+5 = (210 )34 25 , then
2345 134 25 1 32 10 (mod 11).
Thus 2345 mod 11 = 10.
The result actually needed for RSA encryption is the following corollary to Fermats Little Theorem.
Corollary 2 (Eulers Corollary). Let p and q be distinct primes. Then for each
integer a not divisible by either p or q,
a(p1)(q1) 1 (mod p q)
Proof. This is an exercise.
Both Fermats Little Theorem and Eulers Corollary are special cases of a more
general result. To formulate the generalization, we need the following definition.
Definition 1. Eulers phi function : N N is defined by the rule that, for
each positive integer n,
(n) = #{ k : 1 k < n and k is relatively prime to n }.
For example, (2) = #{1} = 1, (3) = #{1, 2} = 2, (4) = #{1, 3} = 2,
(6) = #{1, 5} = 2, and (12) = #{1, 5, 7, 11} = 4.
Then the generalization is as follows.
Theorem 2 (Eulers Theorem). Let m be an integer with m > 1. Then for each
integer a that is relatively prime to m,
a(m) 1 (mod m).
We will not prove Eulers Theorem here, because we do not need it.
Fermats Little Theorem is a special case of Eulers Theorem because, for a prime
p, Eulers phi function takes the value (p) = p 1. Note that, for a prime p, saying
that an integer a is relatively prime to p is equivalent to saying that p does not
divide a.
Eulers Corollary is also a special case of Eulers Theorem because, for distinct
primes p and q, Eulers phi function takes the value (p q) = (p 1)(q 1).
c 2009 by Murray Eisenberg. All rights reserved.
Copyright

You might also like