import math
defisprime(n):if n <=1:returnFalsefor i inrange(2,int(math.sqrt(n)+1)):if n % i ==0:returnFalsereturnTrue
x =int(input())for j inrange(2, x //2+1):
z = x - j
if isprime(z)==1and isprime(j)==1:print("{:d} = {:d} + {:d}".format(x, j, z))break
第4章-4 验证“哥德巴赫猜想”import mathdef isprime(n): if n <= 1: return False for i in range(2, int(math.sqrt(n) + 1)): if n % i == 0: return False return Truex = int(input())for j in range(2, x // 2 + 1): z = x