Summation of primes: Difference between revisions
Content added Content deleted
(Added Wren) |
m (→{{header|Wren}}: Tweak) |
||
Line 38: | Line 38: | ||
import "./fmt" for Fmt |
import "./fmt" for Fmt |
||
Fmt.print("The sum of all primes below 2 million is $,d.", Nums.sum(Int.primeSieve( |
Fmt.print("The sum of all primes below 2 million is $,d.", Nums.sum(Int.primeSieve(2e6-1)))</lang> |
||
{{out}} |
{{out}} |
Revision as of 08:29, 8 November 2021
Summation of primes 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
The task descrition is taken from Project Euler (https://projecteuler.net/problem=10)
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17
Find the sum of all the primes below two million
Ring
<lang ring> load "stdlib.ring" see "working..." + nl sum = 0 limit = 2000000
for n = 2 to limit
if isprime(n) sum += n ok
next
see "The sum of all the primes below two million:" + nl see "" + sum + nl see "done..." + nl </lang>
- Output:
working... The sum of all the primes below two million: 142913828922 done...
Wren
<lang ecmascript>import "./math" for Int, Nums import "./fmt" for Fmt
Fmt.print("The sum of all primes below 2 million is $,d.", Nums.sum(Int.primeSieve(2e6-1)))</lang>
- Output:
The sum of all primes below 2 million is 142,913,828,922.