Question

in Python

The Goldbach conjecture asserts that every even number is the sum of two prime numbers. Write a program that gets a number from the user, checks to make sure that it is even, and then finds two prime numbers that add up to the number.

Answer 1

def is_prime(number):
    if(number == 1):
        return False
    for x in range(2,number):
        if number%x == 0:
            return False
    return True

def main():
    n = int(input("Enter number: "))
    if(n%2==0):
        flag = False
        res = 0
        for i in range(2,n):
            if(is_prime(i) and is_prime(n-i)):
                res = i
                flag = True
        if(flag):
            print("Two prime numbers that add up to",n,"are:",res,",",(n-res))
        else:
            print(n, "is even number. But there is no two prime numbers that add upto",n)
    else:
        print(n,"is NOT even number.")

main()