Check if sum of first n primes is prime: Difference between revisions
Content added Content deleted
No edit summary |
|||
Line 9: | Line 9: | ||
load "stdlib.ring" |
load "stdlib.ring" |
||
see "working..." + nl |
see "working..." + nl |
||
see "Sum of first primes is prime:" + nl |
see "Sum of first n primes is prime:" + nl |
||
primSum = 0 |
primSum = 0 |
||
Revision as of 06:59, 23 July 2021
Check if sum of first n primes is prime is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
- Check if sum of first n primes is prime, where n < 1,000
Ring
<lang ring> load "stdlib.ring" see "working..." + nl see "Sum of first n primes is prime:" + nl primSum = 0
for n = 1 to 1000
if isprime(n) primSum += n if isprime(primSum) see "n" + "(" + n + ") = " + primsum + " is prime" + nl ok ok
next
see "done..." + nl </lang>
- Output:
working... Sum of first primes is prime: n(2) = 2 is prime n(3) = 5 is prime n(7) = 17 is prime n(13) = 41 is prime n(37) = 197 is prime n(43) = 281 is prime n(281) = 7699 is prime n(311) = 8893 is prime n(503) = 22039 is prime n(541) = 24133 is prime n(557) = 25237 is prime n(593) = 28697 is prime n(619) = 32353 is prime n(673) = 37561 is prime n(683) = 38921 is prime n(733) = 43201 is prime n(743) = 44683 is prime n(839) = 55837 is prime n(881) = 61027 is prime n(929) = 66463 is prime n(953) = 70241 is prime done...