find the remainder when
2^1990 is divided by 1990..
plz explain the theorems involved in ur solution..
Thanks perfect hacker..
a second approach to the problem would be
we use euler's totient function here which states
for a prime ; this is because only the multiples of are not relatively prime to .
by using euler's totient theorem
or by using carmichael's theorem
hence remainder when 2^1990 divided by 1990 is 1024
"On a different forum I recieved the following answer ...."
Than that would be okay, but not the way you did it!
And furthermore you dishonor Ramanajuan's name with such blashphemy
yes u right..
the approach is not mine..but i never said i had done it..
m sorry i forgot to mention where i got the second solution from..
i just thought i did share it with u..
i'll keep in mind to share from where and how i got my answer from now on..