Eulers Theorem
Eulers Theorem
of repeated squaring:
=6
Hence, there are 6 numbers less than 18, which are co-prime to it. Cross
check: Numbers co-prime to 18 are 1,5, 7, 11, 13, and 17.
Example 2
What is the Euler number of 20?
Solution: Now, the factorization of 20 is 2, 2, 5. It has only two prime factors i.e. 2
and 5.
So, the Euler number of 20 will be
1 1
𝜑 20 = 20 1 − 1−
2 5
1 4
= 20
2 5
=8
Hence, there are 8 numbers less than 20, which are co-prime to it. Cross
check: Numbers co-prime to 20 are 1, 3, 7, 9, 11, 13, 17 and 19.
Remember: The Euler number of a prime number is always
1 less than the number.
1. 𝝋 𝟓 = 𝟒
2. 𝝋 𝟕 = 𝟔
3. 𝝋 𝟏𝟑 = 𝟏𝟐
Euler’s Theorem
Definition: Euler's Theorem
Let n be a positive integer, and let a be an integer that is relatively prime to n. Then
𝑎𝜑(𝑛) = 1(𝑚𝑜𝑑 𝑛); where φ(𝑛) is Euler's phi function.
=8
So, 1332 ⟹ 138(4)
Then,138 4
𝑚𝑜𝑑 15 ≡ 1.
Example 3
Evaluate 1999 𝑚𝑜𝑑 21 So, 1999 ⟹ 1912 8 +3
Solution: Then,1912 8 +3
𝑚𝑜𝑑 21 = 1912 8
19 3
𝑚𝑜𝑑 21
Determine the Euler number of 21. = 1(6859)(𝑚𝑜𝑑 21) ≡ 13.
1 1
𝜑 21 = 21 1 − 1−
3 7
2 6
𝜑 21 = 21
3 7
= 12
What is the remainder of 192200002/23?
Solution:
The Euler Number of the divisor i.e. 23 is 22.
So, 192200002 ⟹ 1922 100,000 +2
Then,1922 100,000 +2
𝑚𝑜𝑑 23 = 1922 100,000
19 2
𝑚𝑜𝑑 23
= 1(361)(𝑚𝑜𝑑 23) ≡ 16.
Board work 1
Evaluate 1980 (𝑚𝑜𝑑 10).
Solution:
Determine the Euler’s number of 10.
1 1
𝜙 𝑛 = 10 1 − 1− =4
2 5
Since 19 and 10 are relatively prime, then 194 𝑚𝑜𝑑 10 ≡ 1.
1980 𝑚𝑜𝑑 10 = 194 20
𝑚𝑜𝑑 10
= 120 𝑚𝑜𝑑 10 ≡ 1
Board work 2
Evaluate 7975 (𝑚𝑜𝑑 15).
Solution:
Determine the Euler’s number of 15.
1 1
𝜙 𝑛 = 15 1 − 1− =8
3 5
𝜑
Assignment
Furthermore, if ( does not divide ), then there exists some smallest exponent such
that and divides . Hence,
This is a special case of Euler's totient theorem. It is sometimes called Fermat's primality
test.
Examples
Find 331 mod 7.
[Solution: 331 ≡ 3 mod 7]
By Fermat’s Little Theorem, 36 ≡ 1 mod 7. Thus, 331 ≡ 31 ≡ 3 mod 7.
Find 235 mod 7.
[Solution: 235 ≡ 4 mod 7]
By Fermat’s Little Theorem, 26 ≡ 1 mod 7. Thus, 235 ≡ 25 ≡ 32 ≡ 4 mod 7.
Find 128129 mod 17.
[Solution: 128129 ≡ 9 mod 17]
By Fermat’s Little Theorem, 12816 ≡ 1 mod 17. Thus, 128129 ≡ 1281 ≡ 9 mod 17.
Examples
The number 21000 is divided by 13. What is the remainder?
[Solution: 21000 ≡ 3 mod 13]
By Fermat’s Little Theorem, 212 ≡ 1 mod 13. Thus, 21000 ≡ 24 ≡ 3 mod 13.
Find 2925 mod 11.
[Solution: 2925 ≡ 10 mod 11]
By Fermat’s Little Theorem, 2910 ≡ 1 mod 11. Thus, 2925 ≡ 295≡ 10 mod 11.
Try This!
1. Find 2323 𝑚𝑜𝑑 19
2. If 143200 𝑖𝑠 𝑑𝑖𝑣𝑖𝑑𝑒𝑑 𝑏𝑦 23, 𝑤ℎ𝑎𝑡 𝑖𝑠 𝑡ℎ𝑒 𝑟𝑒𝑚𝑎𝑖𝑛𝑑𝑒𝑟?
Activity
Evaluate the following using Little Fermat’s Theorem.
1. 1125 (𝑚𝑜𝑑 11)
2. 2799 (𝑚𝑜𝑑 23)
3. 107123 𝑚𝑜𝑑 37
4. 3575 (𝑚𝑜𝑑 19)
5. 2395 (𝑚𝑜𝑑 31)