#!/usr/bin/python import fermat_test import sys N=10000000 if len(sys.argv) > 1: N = int(sys.argv[1]) do_output = False count = 0 for candidate in range(17, N, 2): if fermat_test.fermat_is_valid_pow(candidate): count += 1 if do_output: print candidate print "Total of ", count, " prime sextuplets"
if val > N: break if not candidate_killed_by(val, prime): new_offsets.append(val) base += primorial return new_offsets primorial_max = 29 primorial_start = 7 primorial = 210 # Start with the one we figured out earlier: 2*3*5*7 offsets = [97] for i in basic_sieve_e.genprime(primorial_max): if i <= primorial_start: continue offsets = add_next_prime(offsets, i, primorial) primorial *= i count = 0 for o in offsets: if fermat_test.fermat_is_valid_pow(o): count += 1 if do_output: print o print "Total of ", count, " prime sextuplets"
#!/usr/bin/python import fermat_test import sys N=10000000 if len(sys.argv) > 1: N = int(sys.argv[1]) do_output = False count = 0 max_n = N/210 for candidate in range(0, max_n): if fermat_test.fermat_is_valid_pow(candidate*210 + 97): count += 1 if do_output: print candidate print "Total of ", count, " prime sextuplets"
#!/usr/bin/python import fermat_test import sys N = 10000000 if len(sys.argv) > 1: N = int(sys.argv[1]) do_output = False count = 0 max_n = N / 210 for candidate in range(0, max_n): if fermat_test.fermat_is_valid_pow(candidate * 210 + 97): count += 1 if do_output: print candidate print "Total of ", count, " prime sextuplets"