python-Goldbach's conjecture（哥德巴赫猜想）

• Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two prime
• Write Python code to prove Goldbach's conjecture for all the number smaller than 1000

#all prime numbers from (2,num)
def all_prime(num):
    list = []
    for i in range(2,num):
        prime=1
        for j in range(2, i):
            if np.mod(i, j) == 0:
                prime=0
                break
        if prime==1:
            list.append(i)
    return list

#Rewrite the code to prove Goldbach's conjecture for all the numbers smaller than 1000

def Goldbach(n):#n is even integer greater than 2
    allprime=all_prime(n)
    for i in allprime:
        if n-i in allprime:
            #print(n, '=', i, '+', n - i)
            return True
            break
    return False

result=True
for n in range(4,1000,2):
    result= result & Goldbach(n)
    if result== False:
        break
print(result)