用Python实现哥德巴赫猜想！

Question

Answer 1

测试两数都为素数就输出答案：

def prove(n):
    if n<=6:
        return -1,-1
    def isPrime(n):
        for i in range(2,n):
            if n%i==0:
                return False
        return True
    for i in range(2,n):
        if isPrime(i) and isPrime(n-i):
            return i, n-i
    

if __name__ == '__main__':
    n = int(input())
    print("%d, %d"%prove(n))