Piprimes: Difference between revisions
Added Easylang
(Added Easylang) |
|||
| (One intermediate revision by one other user not shown) | |||
Line 412:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
n = 1
repeat
write p & " "
n += 1
if isprim n = 1
p += 1
.
until p = 22
.
</syntaxhighlight>
{{out}}
<pre>
0 1 2 2 3 3 4 4 4 4 5 5 6 6 6 6 7 7 8 8 8 8 9 9 9 9 9 9 10 10 11 11 11 11 11 11 12 12 12 12 13 13 14 14 14 14 15 15 15 15 15 15 16 16 16 16 16 16 17 17 18 18 18 18 18 18 19 19 19 19 20 20 21 21 21 21 21 21
</pre>
=={{header|F_Sharp|F#}}==
Line 955 ⟶ 982:
=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="
import "./
var primes = Int.primeSieve(79) // go up to the 22nd
Line 976 ⟶ 1,001:
}
System.print("pi(n), the number of primes <= n, where n >= 1 and pi(n) < 22:")
System.print("\nHighest n for this range = %(pi.count).")</syntaxhighlight>
| |||