10001th prime: Difference between revisions
m
→{{header|ALGOL 68}}: fix typo
m (Realize in F#) |
m (→{{header|ALGOL 68}}: fix typo) |
||
Line 7:
=={{header|ALGOL 68}}==
Chebyshev showed that the limit of pi( n ) / ( n / ln(n) ) as n approaches infinity is 1 ( pi( n ) is the number of primes up to n ).<br>
The APPROXIMATESIEVESIZEFOR operator uses this to find a rough value for size of sieve needed to contain the
{{libheader|ALGOL 68-primes}}
<lang algol68>BEGIN # find the 10001st prime #
| |||