The document discusses Fermat's theorem and Euler's function. It provides the statements and proofs of Fermat's theorem and Euler's theorem. It also gives several examples of using these theorems to find the remainders when dividing large numbers by primes.
The document discusses Fermat's theorem and Euler's function. It provides the statements and proofs of Fermat's theorem and Euler's theorem. It also gives several examples of using these theorems to find the remainders when dividing large numbers by primes.
The document discusses Fermat's theorem and Euler's function. It provides the statements and proofs of Fermat's theorem and Euler's theorem. It also gives several examples of using these theorems to find the remainders when dividing large numbers by primes.
The document discusses Fermat's theorem and Euler's function. It provides the statements and proofs of Fermat's theorem and Euler's theorem. It also gives several examples of using these theorems to find the remainders when dividing large numbers by primes.
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
You are on page 1/ 46
ABHAY MAHAJAN
B.Tech. IIT Roorkee
➔ 11+ years teaching experience ➔ Mentored and taught around 20000+ students ➔ Produced 400+ IIT selections ➔ 10+ INMO selections ➔ 1 EGMO Selection Fermat’s Theorem Euler Function FERMAT’S THEOREM
Statement: Let p be prime number and A be a
number not divisible by p. Then Ap - 1 ≡ 1 (mod p). FERMAT’S THEOREM Statement: Let p be prime number and A be a number not divisible by p. Then Ap - 1 ≡ 1 (mod p). Proof: Consider the p – 1 numbers: A, 2A, 3A, …., (p – 1)A. We can show that no two of these numbers have the same remainder when divided by p. Indeed, if kA ≡ nA (mod p), then k ≡ n (mod p). This is impossible if k and n are unequal and both are less than p. Therefore, among the remainders of these p – 1 numbers when divided by p each of the numbers 1 through p - 1 is represented exactly once.
Multiplying them together, we have
A.2A.3A …. (p – 1)A ≡ 1 2 3 … (p – 1) (mod p); FERMAT’S THEOREM Statement: Let p be prime number and A be a number not divisible by p. Then Ap - 1 ≡ 1 (mod p). Proof: That is, (p – 1)! Ap – 1 ≡ (p – 1)! (mod p). Now p is prime, which implies that (p – 1)! and p are relatively prime. We obtain Ap - 1 ≡ 1 (mod p).
Corollary: Let p be a prime number. Then for any
integer A we have Ap ≡ A (mod p). Fermat’s little theorem is not just an unexpected and “neat” fact. It also provides a very powerful tool for solving many problems in arithmetic. Let’s see some of them !!!! Q. Find the remainder when 272 is divided by 73. Q. Find the remainder when 272 is divided by 73.
Solution Since 73 is prime, 273 - 1 ≡ 1 (mod 73) ⇒ 272 ≡ 1 (mod 73) ∴ Remainder is 1. Q. Find the remainder when 2106 is divided by 53. Q. Find the remainder when 2106 is divided by 53.
Solution 252 ≡ 1 (mod 53) Square both sides 2104 ≡ 1 (mod 53)..... (1) 22 ≡ 4 (mod 53).....(2) Multiplying (1) and (2) ⇒ 2106 ≡ 4 (mod 53) ⇒Remainder = 4 Q. Find the remainder when 591 is divided by 31. Q. Find the remainder when 591 is divided by 31.
Solution 530 ≡ 1 (mod 31) Take cube on both sides 590 ≡ 1 (mod 31) Multiply with 5 591 ≡ 5 (mod 31) Remainder = 5 1972 AHSME
Q. The number 21000 is divided by 13. What is the
remainder? Q. The number 21000 is divided by 13. What is the remainder?
Solution By Fermat’s Little Theorem 212 ≡ 1 mod 13. Thus, 21000 ≡ 2400 ≡ 240 ≡ 24 ≡ 16 ≡ 3 mod 13. Q. Find 2925 mod 11. Q. Find 2925 mod 11.
Solution By Fermat’s Little Theorem, 2910 ≡ 710 ≡ 1 mod 11. Thus, 2925 ≡ 75 ≡ 7 (–4)4 ≡ 7.256 ≡ 7.3 ≡ 21 ≡ 10 mod 11. Q. Find 220 + 330 + 440 + 550 + 660 mod 7. Q. Find 220 + 330 + 440 + 550 + 660 mod 7.
to n is called Euler’s function for n and is denoted by Φ(n). Examples: Φ(1) = 1 Φ(2) = 1 Φ(8) = 4 Q. (a) Find φ (17) (b) Find φ (81) (c) Find φ (100) Solution Ф (17) = 16 because none of the integers in {1,..., 17) except 17 itself have any common divisor with 17. Ф (81) = 54: from the integers {1,...,81} we exclude the ones divisible by 3, of which there are 27. Ф(100) = 40. There are two ways to do this There are 50 numbers in {1,....100} divisible by 2, which we discard. There are also 20 numbers divisible by 5, which we discard. But 10 numbers were divisible by 10, so we counted them since twice so Ф (100) = 100 –50 – 20 + 10 = 40
Of the numbers in {1,...100}, ½ are not divisible by 2,
and ⅘ are not divisible by 5. So the number that aren’t divisible by both is ½. ⅘. 100 = 40. Q. Prove that , where p is prime EULER’S FUNCTION
If then Euler’s Theorem
If gcd (n, a) =1, then
aф(n) ≡ 1 (mod n) If n = p, then we obtain Fermat’s little theorem. Q. Find the last digit of 72013. Q. Find the last digit of 72013.
Solution Since ф(10) = 4, to find 72013 mod 10 we find 2013 mod 4 = 1. So 72013 ≡ 71 = 7 (mod 10). Q. Find the remainder when 7120 is divided by 143.
A 0
B 1
C 5
D 6 Q. Find the remainder when 7120 is divided by 143.
A 0
B 1
C 5
D 6 Q. Find the remainder when 7120 is divided by 143.
Q. Determine the remainder of 1992 upon division by 92.
Q. Determine the remainder of 1992 upon division by 92.
Solution We are asked to find 1992(mod 92) since 19 and 92 are relatively prime, we can use euler’s theorem extension of FLT note that (1942)2.194 mod 92 ≡ 194 mod 92 and from here, is simple , but ≡ 194 mod 92 ≡ (361)2 ≡ 852 ≡ 7225 ≡ SAWAAL Q.Find the remainder when is divided by 19.
Note: Solution at the End
Let’s Bring GOLD For INDIA Q.Find the remainder when is divided by 19. Solution By Fermat’s little theorem we have 318 ≡ 1 ( mod 19). This hints that we will want to find in modulo 18. Now note that ф(18) = 6. So by Euler’s theorem we have, 56 ≡ 1 (mod 18) This hints that we will want to evaluate 11 7! In modulo 6, this is easy because 117! ≡ (–1)7! ≡ 1 (mod 6) So there exist a such that 117! = 6a +1 , hence ≡ 56a.5 ≡ 5 ( mod 18).
This means that there exists b such that = 18b + 5,
