1) Euler 's theorem
This theorem applies only on some condition M & N must be coprime to each other.
What is coprime numbers ?
Those numbers which have common hcf 1 is defined as coprime numbers. Therefore HCF(n1,n2,n3....) needs to be 1.
Here HCF(M,N)=1
->Take a look on problem how to solve it.
Lets say we have to find remainder of 1134/12.
First, check the condition HCF(8,13)=1. If yes, then proceed
Prime Factorize 12= 22* 3
Calculate Euler Totient Function ∅(12)= 12 (1-1/2) * (1-1/3)
= 12 * 1/2 * 2/3 = 4
So 114n /12=1 (n can be any whole number)
and (114*8 * 112)/12 =1
1132 /12=1 therefore we left with 112 /12=121/12=1
So eventually we get remainder as 1. Check your result by calculator also.
2) Fermet Theorem - Its very easy extended version of above. N must be prime and M & N should be co-prime.
->Remainder [MN /N]= M
->Remainer [MN-1 /N]= 1
-> MN-M is divisible by N.
Very easy to implement, direct questions comes so apply the theorem directly.
3) Wilson Theorem - M must be prime number
-> Remainder [(M-1)!/M]=M-1
-> Remainder[(M-2)!/M]=1
-> 11!/13 = (11-2)!/13 = 1
4) x = 1! + 2*2! + 3*3!..............10*10!
Remainder when x+2 divided by 11!
1*1! can be written as 2! - 1!
2*2! can be written as 3!-2!
.
.
.
.
10*10! can be written as 11!-10!
After adding them we get only 11! - 1
x + 2 = 11! - 1 + 2 = 11! + 1
(11!+1)/11! = 1
finally 1 as remainder.
Important Properties on Remainders
5) Remainder [a*b / x ] = Remainder [a / x] * Remainder [b / x].
6) Remainder [a / x ] = 1 , then Remainder [ aany power /x ]=1
IT's all about the remainder theorems time to wrap up.
Ques - (1! + 2! + 3! + 4! + 5!)/24 what is the remainder ?
4! and 5! is divisible by 24.
so 1!+2!+3!=9/24
=9
0 comments:
Post a Comment