Sum of primes in odd positions is prime: Difference between revisions
Content added Content deleted
(→{{header|Raku}}: Added Raku solution) |
|||
Line 94: | Line 94: | ||
load "stdlib.ring" |
load "stdlib.ring" |
||
see "working..." + nl |
see "working..." + nl |
||
see "p |
see "i p sum" + nl |
||
nr = 0 |
nr = 0 |
||
Line 106: | Line 106: | ||
sum += n |
sum += n |
||
if isprime(sum) |
if isprime(sum) |
||
see "" + n + " " + sum + nl |
see "" + nr + " " + n + " " + sum + nl |
||
ok |
ok |
||
ok |
ok |
||
Line 117: | Line 117: | ||
<pre> |
<pre> |
||
working... |
working... |
||
i p sum |
|||
2 2 |
1 2 2 |
||
5 7 |
3 5 7 |
||
31 89 |
11 31 89 |
||
103 659 |
27 103 659 |
||
149 1181 |
35 149 1181 |
||
331 5021 |
67 331 5021 |
||
467 9923 |
91 467 9923 |
||
499 10909 |
95 499 10909 |
||
523 11941 |
99 523 11941 |
||
653 17959 |
119 653 17959 |
||
823 26879 |
143 823 26879 |
||
done... |
done... |
||
</pre> |
</pre> |