remainder when 2^1040 is divided by 131

• 2^1040 mod 131
  Since 2 nd 131 are co-primes, we can use Euler theorem...
  E[131] = 130
  So 2^E[131] = 1
  (2^130)^8 mod 131
  1 mod 131
  
  Ans : 1
  
• 9 years agoHelpfull: Yes(2) No(1)
• @SARASWATHY yrr whats E[131] = 130
  i dont get this poin of u. not even in the previous ques of power
• 9 years agoHelpfull: Yes(2) No(0)
• 2^1024 = 256^130
  so its 256^130 mod 131
  256=125(mod 131)
  256^130=125^130(mod 131)
  
  by Fermat’s Little Theorem
  125^130=1(mod 131)
  
  so remainder is 1
• 9 years agoHelpfull: Yes(1) No(0)