Example #1
0
import euler
import math

sieve = euler.sieve_of_eratosthenes(100000)
sieve_dic = euler.list_to_dic(sieve)

def check_goldbach(n):
	prime_ptr = 0
	while(True):
		prime = sieve[prime_ptr]
		if prime > n:
			break
		if euler.is_square((n - prime)/2):
			return True
		prime_ptr += 1
	return False

def main():
	n = 9
	while(True):
		if n not in sieve_dic:
			if not check_goldbach(n):
				break
		n += 2
	return n


print main()
Example #2
0
import euler
from numba import jit

dic = euler.list_to_dic(euler.sieve_of_eratosthenes(10000000))

def main():
	max_val = -1
	global_a, global_b = 0, 0
	for a in range(-999,1000):
		for b in range(-999,1000):
			n = 0
			count = 0
			while(True):
				if (n**2 + a*n + b) in dic:
					count += 1
				else:
					break
				n += 1
			if count>=max_val:
				max_val = count
				global_a, global_b = a, b 
	return global_a, global_b, max_val

global_a, global_b, max_val = main()
print (global_a,global_b,max_val)