def time_execution_primes(order): prime_list = primes[order] total_time = 0 iterations = len(prime_list) for prime in prime_list: start_time = time.time() baillie_psw(prime) total_time += (time.time() - start_time) return total_time/iterations, iterations
def fermat_test(n=12): for x in xrange(n): print "2^(2^{0}) +1 = 2^{1} + 1 is ".format(x, 2**x), 'prime' if baillie_psw(2**(2**x) + 1) else 'composite'