Check if sum of first n primes is prime: Difference between revisions

Content added Content deleted

Inline

@@ Line 44: / Line 44: @@
 see "Sum of first primes is prime:" + nl
 n = 0
+nr = 0
 num = 0
 primSum = 0
@@ Line 50: / Line 51: @@
     n++
     if isprime(n)
+       nr++
        primSum += n
        if isprime(primSum)
           num++
-          see "n" + "(" + num + ") = " + primsum + " is prime" + nl
+          see "n" + "(" + nr + ") = " + primsum + " is prime" + nl
        ok
     ok
@@ Line 69: / Line 71: @@
 n(1) = 2 is prime
 n(2) = 5 is prime
-n(3) = 17 is prime
+n(4) = 17 is prime
-n(4) = 41 is prime
+n(6) = 41 is prime
-n(5) = 197 is prime
+n(12) = 197 is prime
-n(6) = 281 is prime
+n(14) = 281 is prime
-n(7) = 7699 is prime
+n(60) = 7699 is prime
-n(8) = 8893 is prime
+n(64) = 8893 is prime
-n(9) = 22039 is prime
+n(96) = 22039 is prime
-n(10) = 24133 is prime
+n(100) = 24133 is prime
-n(11) = 25237 is prime
+n(102) = 25237 is prime
-n(12) = 28697 is prime
+n(108) = 28697 is prime
-n(13) = 32353 is prime
+n(114) = 32353 is prime
-n(14) = 37561 is prime
+n(122) = 37561 is prime
-n(15) = 38921 is prime
+n(124) = 38921 is prime
-n(16) = 43201 is prime
+n(130) = 43201 is prime
-n(17) = 44683 is prime
+n(132) = 44683 is prime
-n(18) = 55837 is prime
+n(146) = 55837 is prime
-n(19) = 61027 is prime
+n(152) = 61027 is prime
-n(20) = 66463 is prime
+n(158) = 66463 is prime
 done...
 </pre>