New Code
I work on the Goldback conjecture and the authors
of the verify explain that they compute the list of the prime
Why in their method they need this list?
N even number
repeat
for i:=1 to 100
M:=NPrimes(i)
If IsPrime(M) then N:=n+2;
until N > ?????
John
