+0  
 
0
91
1
avatar

Show using Fermat's Little Theorem that 66013 is not prime.

Guest Jul 12, 2017
Sort: 

1+0 Answers

 #1
avatar
0

Show using Fermat's Little Theorem that 66013 is not prime.

 

If: 2^(66,013 - 1) mod (66,013) = 1, it is probable prime, otherwise it is composite.

But, 2^(66,012) mod (66,013) =11,626. Therefore, it is not prime!

Whatever base between 2 and 66,013 you may try, you will get a remainder > 1.

Guest Jul 12, 2017
edited by Guest  Jul 12, 2017

17 Online Users

avatar
avatar
We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our social media, advertising and analytics partners.  See details