Lucas-Lehmer test: Difference between revisions

s := (s ** s2 - 2) MOD m p

fi = od = None

if p == 2 : return True

elif p <= 1 or p % 2 == 0 : return False

for i in range(3, int(sqrt(p))+1, 2 ): # do

#if print "p % i == 0:",p return False

if p == 2 : return True

m_p = 2( **1 << p ) - 1; s = 4;

for i in range(3, p+1): # do

s = (s ** s2 - 2) % m_p

precision = 20000; # maximum requested number of decimal places of 2 ** MP-1 #

long_long_bits_widthlong_bits_width = precision / log(2) * log(10);

upb_prime = int( long_long_bits_widthlong_bits_width - 1 ) / 2; # no unsigned #

upb_count = 45; # find 45 mprimes if int haswas given enough bits #

print ((" Finding Mersenne primes in M[2..%d]: "%upb_prime));

for p in range(2, upb_prime+1): # do

if is_prime(p) :and is_mersenne_prime(p):

if is_mersenne_primeprint("M%d"%p) :,

stdout.writeflush(" M%d"%p);

count += stdout.flush();1

if count >= upb_count : break; fi