MODULE 7: EULER’S GENERALIZATION OF FERMAT’S THEOREM

Learning Target
At the end of this module, the learner should be able to:
1. Discuss Euler’s Generalization of Fermat’s Little Theorem
2. Prove bla bla

Definition 1. Euler’s Phi Function

 For n ≥ 1, let Φ (n) denote the number of positive integers less than n that are relatively prime to n .

Illustrative Examples 1
1. Find Φ (5) .
Solution:
We say two numbers are relatively prime if they have no prime factors in common. That is,
gcd ( n ,m )=1 such that m ≤n .
Among the positive integer that do not exceed 5, there are 8 numbers that are relatively prime to
16. Specifically, these are 1, 2, 3, and 4. Thus, Φ ( 5 ) =4 .

2. Find Φ (16).
Solution:
Among the positive integer that do not exceed 16, there are 8 numbers that are relatively prime to
16. Specifically, these are 1, 3, 5, 7, 9, 11, 13, 15. Thus, Φ ( 16 )=8.

3. Find Φ (40).
Solution:
Among the positive integer that do not exceed 40, there are 16 numbers that are relatively prime to
40. Specifically, these are 1, 3, 7, 9, 11, 13, 17, 19, 21, 23, 27, 29, 31, 33, 37, 39. Thus, Φ ( 40 )=16 .

 EULER PHI FUNCTION OF PRIME. Note that, if n is a prime number, then every integer less than n is a
relatively prime to n . In symbols, ϕ ( n )=n−1 if and only if n is prime. On the other hand, if n>1 is
composite, then n has a divisor d such that 1<d <n . It follows that there are at least two integers among
1,2,3 , … , n that are not relatively prime to n , namely, d and n itself. As a result, ϕ ( n ) ≤ n−2 . This proves
that for n>1, ϕ ( n )=n−1 if and only if n is prime.

Illustrative Examples:
1. Find Φ (23).
Solution:
Since 21377 is a prime number then Φ ( 23 ) =23−1=22. These are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22.
2. Find Φ (21377).
Solution:
Since 21377 is a prime number then Φ ( 21377 )=21377−1=21376.

Theorem 1. If p is prime, and k > 0, then ϕ ( p ) = p − p

k k k−1
( 1p )
=p k 1−

Proof. From Euler Phi Function of Prime, ϕ ( p )= p−1. Clearly, gcd ( n , p k ) =1 ⟺ p ∤n .There are
k
pk−1 ∈ Z ∋1 ≤ p k−1 ≤ p k which are divisible by p :n ∈{ p , 2 p , 3 p , … , ( p k−1 ) p }. Thus, {1 , 2 , … , p } contains exactly
pk − p k−1 that are relatively prime to pk . Therefore, by definition of ϕ , ϕ ( p k ) = pk − p k−1.

Illustrative Examples:
1. ϕ ( 9 )=ϕ ( 32 ) =32−3=6. The six integers that are less than and relatively prime to 9 are 1, 2, 4, 5, 7, 8.
2. ϕ ( 32 )=ϕ ( 25 )=25−24=16. The sixteen integers that are less than and relatively prime to 16 are 1, 3, 5, 7, 9,
11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31.

Theorem 2. The function ϕ is multiplicative, that is, ϕ ( mn )=ϕ(m)ϕ (n) where m , n∈ Z ¿ 0.

1
EULER’S GENERALIZATION OF FERMAT’S THEOREM

DIAZ, ADRIANO JR. A.

INOCENCIO, JERGBI JERSON
MOJICA, MARY JOY ANGELIQUE

College of Science and Computer Studies Graduate Studies

De La Salle University- Dasmarinas