PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#Goldbach
#Every even number greater than 2 can be expressed as the sum of two prime numbers
def main():
num = int(input())
while num % 2 != 0 :
num = int(input())
Goldbach(num)
# dado un numero par haya 2 primos
# que sumados dan ese numero
def Goldbach(n) :
for k in range(2, int(n/2)) :
if Prime(k) :
if Prime(n - k) :
print(str(k) + "," + str(n-k))
# determina si un numero es primo
def Prime(p) :
d = 0
for y in range(1 , p ) :
if p % y == 0 :
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run