Scribd
Upload
23 views22 pages

Eulers Theorem

The document discusses methods for evaluating modular arithmetic using repeated squaring and Euler's phi function. It provides examples of calculating remainders using Euler's theorem and Fermat's little theorem, including specific calculations for various numbers. Additionally, it includes activities and assignments related to these mathematical concepts.

Uploaded by

jamaicadaramayo
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
23 views22 pages

Eulers Theorem

The document discusses methods for evaluating modular arithmetic using repeated squaring and Euler's phi function. It provides examples of calculating remainders using Euler's theorem and Fermat's little theorem, including specific calculations for various numbers. Additionally, it includes activities and assignments related to these mathematical concepts.

Uploaded by

jamaicadaramayo
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/ 22

Short Review  These powers of 5 can be obtained by means

of repeated squaring:

Evaluate 529 (𝑚𝑜𝑑 11). 51 ≡ 5(𝑚𝑜𝑑 11)

Solution: 52 = 25 ≡ 3(𝑚𝑜𝑑 11)

First, write the exponent 29 as a sum of 54 = 52 2


≡ 32 ≡ 9(𝑚𝑜𝑑 11)
powers of 2 58 = 54 2
≡ 92 ≡ 4(𝑚𝑜𝑑 11)
29 = 16 + 13 = 16 + 8 + 4 + 1 516 = 58 2
≡ 42 ≡ 5(𝑚𝑜𝑑 11)
 We are essentially expressing 29 in
base 2. We can now write 529 = 516 . 58 . 54 . 5 ≡ 5(4)(9)(5)(𝑚𝑜𝑑 11)
529 = 516+8+4+1 = 516 (58 )(54 )(5)  After simplification, we find 529 (𝑚𝑜𝑑 11) ≡ 9.
What is the remainder if 192200002 is divided by 23?
Euler’s Phi Function
The Euler's phi function counts the positive integers up to a given integer n that are relatively
prime to n. For example, there are the six numbers relatively prime to 9: 1, 2, 4, 5, 7 and 8.
Mathematically, the Euler's phi function of a number n denoted by the symbol 𝜑(n) is calculated as
explained below.
1 1 1
𝜑 𝑛 =𝑛 1− 1− 1− where P, Q and R are the different prime factors of n.
𝑃 𝑄 𝑅
Example 1
What is the Euler number of 18?
Solution: Now, the factorization of 18 is (2)(3)(3). It has only two prime factors i.e.
2 and 3.
So, the Euler number of 18 will be
1 1
𝜑 18 = 18 1 − 1−
2 3
1 2
= 18
2 3

=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.

 When 𝒂𝜑 𝑛 is divided by n, the remainder will always be 1, where


𝜑 𝑛 is the Euler number of n and a and n are co-prime to each
other.

 When 𝒂[𝜑 𝑛 ](𝒌) is divided by n, where k is an integer, the


remainder will always be 1. That is if the power is any multiple of
the Euler number of the divisor.
This concept has a wonderful application in answering remainder
questions.
Example 1
What is the remainder when 1318 is divided by 19?
Solution:
 Determine the Euler number of 19.
𝜑 19 = 18
So, 1318 𝑚𝑜𝑑 19 ≡ 1
Example 2
What is the remainder when 1332 is divided by 15?
Solution:
 Determine the Euler number of 15.
1 1
𝜑 15 = 15 1 − 1−
3 5
2 4
𝜑 15 = 15
3 5

=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

 Since 79 and 15 are relatively prime, then 798 𝑚𝑜𝑑 15 ≡ 1.


7975 𝑚𝑜𝑑 15 = 798 9 +3
𝑚𝑜𝑑 15
= (798 )9 793 𝑚𝑜𝑑 15
= 19 493039 𝑚𝑜𝑑 15 ≡ 4
Activity
Evaluate the following:
1. 2327 (𝑚𝑜𝑑 10)
2. 4922 (𝑚𝑜𝑑 22)

𝜑
Assignment

1. Research real-life applications of Euler’s Theorem in another field.

2. Study in advance Fermat’s Little Theorem and Linear Conguences.


Fermat’s Little Theorem
Definition
If is a prime number and is a natural number, then

Furthermore, if ( does not divide ), then there exists some smallest exponent such
that and divides . Hence,

The theorem is sometimes also simply known as "Fermat's theorem".

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)

You might also like