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 07:36, 23 July 2021

14 bytes added ,  2 years ago
no edit summary
No edit summary
Line 1:
{{Draft task}}
 
;Task:Check if sum of first '''n''' primes is prime, where '''n <= 1,00020'''
 
<br><br>
Line 9:
load "stdlib.ring"
see "working..." + nl
see "Sum of first n primes is prime:" + nl
num = 0
primSum = 0
 
for n = 1 to 100010000
if isprime(n)
primSum += n
if isprime(primSum)
num++
see "n" + "(" + nnum + ") = " + primsum + " is prime" + nl
ok
ok
if num = 20
exit
ok
next
Line 27 ⟶ 32:
working...
Sum of first primes is prime:
n(21) = 2 is prime
n(32) = 5 is prime
n(73) = 17 is prime
n(134) = 41 is prime
n(375) = 197 is prime
n(436) = 281 is prime
n(2817) = 7699 is prime
n(3118) = 8893 is prime
n(5039) = 22039 is prime
n(54110) = 24133 is prime
n(55711) = 25237 is prime
n(59312) = 28697 is prime
n(61913) = 32353 is prime
n(67314) = 37561 is prime
n(68315) = 38921 is prime
n(73316) = 43201 is prime
n(74317) = 44683 is prime
n(83918) = 55837 is prime
n(88119) = 61027 is prime
n(92920) = 66463 is prime
n(953) = 70241 is prime
done...
</pre>
CalmoSoft
2,468

edits

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