Summation of primes: Difference between revisions
Content added Content deleted
m (→{{header|Pascal}}: uses primsieve instead of primTrial @home limit 1E9 sums to 24739512092254535 in 640ms like https://www.spoj.com/problems/SUMPRIM1/en/) |
(Created Nim solution.) |
||
Line 432: | Line 432: | ||
142913828922 |
142913828922 |
||
</pre> |
</pre> |
||
=={{header|Nim}}== |
|||
<syntaxhighlight lang="Nim">func isPrime(n: Natural): bool = |
|||
## Return true if "n" is prime. |
|||
## "n" is expected not to be a multiple of 2 or 3. |
|||
var k = 5 |
|||
while k * k <= n: |
|||
if n mod k == 0 or n mod (k + 2) == 0: return false |
|||
inc k, 6 |
|||
result = true |
|||
var sum = 2 + 3 |
|||
var n = 5 |
|||
while n < 2_000_000: |
|||
if n.isPrime: |
|||
inc sum, n |
|||
inc n, 2 |
|||
if n.isPrime: |
|||
inc sum, n |
|||
inc n, 4 |
|||
echo sum |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre>142913828922</pre> |
|||
=={{header|PARI/GP}}== |
=={{header|PARI/GP}}== |