Find the remainder when ((13^141) +(11^141) ) is divided by 24..please help with explanation..

Dear student 

It is solved by using Fermats Little theorem 

Which is not a part of Your exam syllabus 

It is asked in CAT level examinatin .

Good Luck 

dear student, both the answers given by vikas and saurabh are ABSOLUTELY WRONG and hence you shouldnt give any attention to their crappy excuses of using fermat theorem, to hell with fermat and his theorem!!

CORRECT SOLUTION:

we know the identity

a^(2n+1) + b^(2n+1)= (a+b)(a^2n*b^0 – a^(2n-1)*b^1 + a^(2n-2)*b^2 – ,,,,,,,, – a^1*b^(2n-1) + b^2n), where n is a natural no

simply substitute a=13 and b= 11 and n= 70, we get