Problem 46

p46.py

def goldbachs(number):
    for x in range(1, int(math.sqrt(number))+1):
        temp_var = number - 2*(x**2)
        if is_prime(temp_var) == True:
            return True
    return False

def compute():
    count = 33
    while True:
        if is_prime(count):
            count += 2
        else:
            if goldbachs(count):
                count += 2
            else:
                return count