th last two digits in the multiplication of 35*34*33*32*31*30*29*28*27*26?
00
40
30
10
none of these
how do i use the eulers method to solve a question?
thanx in advance
There is a 0 in 30 and a 5 and an even number.So,last 2 digits have to be 00
option (1)Some literature on Euler Theorem here:
Euler's theorem - Wikipedia, the free encyclopediaBasically if we have to find the remainder of
a^n mod b
where a and b are coprime,and b's Euler number is say x.
Now,if n is a multiple of x then the remainder is 1.
Difficult?Lets see an example
Find the remainder of 29^72 mod 11
Now,Euler number of any integer n=A^x*B^y*C^z where A,B,C are the prime factors of n is given by:
n(1-1/A)(1-1/B)(1-1/C)
For prime numbers,Euler number is equal to (n-1)
So,Euler number of 11 is 10.
So,as 29 and 11 are co prime.If the numerator is of the format 29^10x,then the remainder will be 1.
So, 29^70 mod 11 is 1
So,it effectively becomes 29^2 mod 11
841 mod 11
the answer is 5.
Now,there are some variations to these kind of sums,you can find them on the net.
EDIT: Coprime numbers are those which do not share any common factors except 1.