retagged by
3,774 views

1 Answer

Best answer
8 votes
8 votes

Whenever you see this type of question then use this method to solve this.

5^1 = 5 //Not divisible by 77, so go on increasing power of 5

5^2 = 25 //Not divisible by 77, so go on increasing power of 5

5^3 = 125 //Divisible by 77 but return remainder 48, which is a huge number. Our objective is to get as less remainder as possible.

5^4 = 625 // Divisible by 77, and remainder is 9. It is pretty less, then stop here.

Now 5^13 = ((5^4)*(5^4)*(5^4)*5)%77

               = (9 * 9 * 9 * 5) %77

               = (729 * 5) %77

               = (36 * 5) % 77              // 729%77 = 36

               = 180 % 77 = 26
Hence 26 will be the answer. 

selected by

Related questions

1 votes
1 votes
1 answer
1
samarpita asked May 9, 2022
9,339 views
Eigen Values of an orthogonal matrix will always be +1 and the modulus will also be always |1|? I have a doubt on this point .
1 votes
1 votes
1 answer
2
reena_kandari asked Jan 9, 2018
923 views
mod of following asynchronous counter is??Due to the delay of OR gate I think mod is $10$.
3 votes
3 votes
1 answer
4
Aboveallplayer asked Aug 10, 2016
634 views
I am getting 6 answer is given 5 Please verify anyone