Rosetta Code

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

Page Discussion

Check if sum of first n primes is prime (view source)

Revision as of 09:27, 23 July 2021

34 bytes added ,  2 years ago
→‎{{header|Ring}}
Line 44:
see "Sum of first primes is prime:" + nl
n = 0
nr = 0
num = 0
primSum = 0
Line 50 ⟶ 51:
n++
if isprime(n)
nr++
primSum += n
if isprime(primSum)
num++
see "n" + "(" + numnr + ") = " + primsum + " is prime" + nl
ok
ok
Line 69 ⟶ 71:
n(1) = 2 is prime
n(2) = 5 is prime
n(34) = 17 is prime
n(46) = 41 is prime
n(512) = 197 is prime
n(614) = 281 is prime
n(760) = 7699 is prime
n(864) = 8893 is prime
n(996) = 22039 is prime
n(10100) = 24133 is prime
n(11102) = 25237 is prime
n(12108) = 28697 is prime
n(13114) = 32353 is prime
n(14122) = 37561 is prime
n(15124) = 38921 is prime
n(16130) = 43201 is prime
n(17132) = 44683 is prime
n(18146) = 55837 is prime
n(19152) = 61027 is prime
n(20158) = 66463 is prime
done...
</pre>
CalmoSoft
2,468

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/313843"