In most cases, if an even number is written as the sum of two prime numbers, one of them is very small. Very rarely, the primes are both bigger than say 50. Try to find out how many such cases there are in the range 2..3000.

# using goldbach as defined previously

def goldbach_list(start,end,threshold=None):

start = max([start,4])

for n in range(start,end+1):

if n % 2 == 0:

i,j = goldbach(n)

if threshold == None or i > threshold:

print "%d = %d + %d" % (n, i, j)

## No comments:

Post a Comment