Sum of primes in odd positions is prime: Difference between revisions
Sum of primes in odd positions is prime (view source)
Revision as of 14:24, 1 September 2021
, 2 years agoAdded Wren
No edit summary |
(Added Wren) |
||
Line 72:
823 26879
done...
</pre>
=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-trait}}
{{libheader|Wren-fmt}}
<lang ecmascript>import "/math" for Int
import "/trait" for Indexed
import "/fmt" for Fmt
var primes = Int.primeSieve(999)
var sum = 0
System.print(" i p[i] Σp[i]")
System.print("----------------")
for (se in Indexed.new(primes, 2)) {
sum = sum + se.value
if (Int.isPrime(sum)) Fmt.print("$3d $3d $,6d", se.index + 1, se.value, sum)
}</lang>
{{out}}
<pre>
i p[i] Σp[i]
----------------
1 2 2
3 5 7
11 31 89
27 103 659
35 149 1,181
67 331 5,021
91 467 9,923
95 499 10,909
99 523 11,941
119 653 17,959
143 823 26,879
</pre>
| |||