Sum of primes in odd positions is prime: Difference between revisions

Content added Content deleted
Line 812: Line 812:


print "i\tp(n)\tsum\n----\t-----\t------"
print "i\tp(n)\tsum\n----\t-----\t------"
for n = 2 to 999
for n = 2 to 1000
if isPrime(n) then
if isPrime(n) then
i = i + 1
i = i + 1