Piprimes: Difference between revisions

Added 11l
(Added 11l)
Line 11:
:* &nbsp; the OEIS entry: &nbsp; [http://oeis.org/A000720 A0000720 pi(n), the number of primes <= n. Sometimes called PrimePi(n)...].
<br><br>
 
=={{header|11l}}==
{{trans|Nim}}
 
<lang 11l>F is_prime(n)
I n == 2
R 1B
I n < 2 | n % 2 == 0
R 0B
L(i) (3 .. Int(sqrt(n))).step(2)
I n % i == 0
R 0B
R 1B
 
V pi = 0
V n = 1
L
print(‘#2’.format(pi), end' I n % 10 == 0 {"\n"} E ‘ ’)
n++
I is_prime(n)
pi++
I pi == 22
L.break
print()</lang>
 
{{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|Action!}}==
1,480

edits