Check if sum of first n primes is prime: Difference between revisions
Content added Content deleted
No edit summary |
|||
| (14 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
I deleted it because exists a similar '''Summarize primes''' task. |
|||
{{Draft task}} |
|||
<br>Gal Zsolt (CalmoSoft) |
|||
;Task:Check if sum of first '''n''' primes is prime, where '''n < 1000''' |
|||
<br><br> |
|||
=={{header|Ring}}== |
|||
<lang ring> |
|||
load "stdlib.ring" |
|||
see "working..." + nl |
|||
see "Sum of first 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> |
|||
{{out}} |
|||
<pre> |
|||
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... |
|||
</pre> |
|||
Latest revision as of 10:35, 23 July 2021
I deleted it because exists a similar Summarize primes task.
Gal Zsolt (CalmoSoft)