+0  
 
0
258
1
avatar

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

Guest Jul 12, 2017
 #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

15 Online Users

New Privacy Policy

We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive information about your use of our website.
For more information: our cookie policy and privacy policy.