Goldbach's comet: Difference between revisions

m
Line 281:
from sympy import isprime
 
def prime_duo_partitionsg(n):
assert n > 2 and n % 2 == 0, 'n in goldbach function g(n) must be even'
if isprime(n):
count = yield (n,)0
for i in range(1, n//2 + 1):
if isprime(i) and isprime(n - i):
yieldcount (i, n - i)+= 1
return count
 
def g(n):
assert n > 2 and n % 2 == 0, 'n in goldbach function g(n) must be even'
return len(list(prime_duo_partitions(n)))
 
print('The first 100 G numbers are:')
Line 321 ⟶ 318:
The value of G(1000000) is 5402
</pre>
 
 
=={{header|Raku}}==
4,108

edits