mostly on computers and mathematics
2 seems never to be a primitive root of a Mersenne number (and consequently Mersenne primes). Even more strongly, it eliminated by (p-1)/2
forprime(i=3,10000,p=2^i-1;g=Mod(2,p)^((p-1)/2);if(g!=Mod(1,p),print(i)))
Post a Comment
No comments :
Post a Comment