Anonymous user
Extensible prime generator: Difference between revisions
m
Tidied.
m (→{{header|Lua}}: cleanup) |
m (Tidied.) |
||
Line 23:
'''Note 2:''' If a languages in-built prime generator is extensible or is guaranteed to generate primes up to a system limit, (2<sup>31</sup> or memory overflow for example), then this may be used as long as an explanation of the limits of the prime generator is also given. (Which may include a link to/excerpt from, language documentation).
http://www.primos.mat.br/indexen.html▼
<br>
▲* The task is written so it may be useful in solving the task [[Emirp primes]] as well as others (depending on its efficiency).
<br>▼
<br>
;Reference:
▲* [http://www.primos.mat.br/indexen.html Prime Numbers]. Website with large count of primes.
▲<br><br>
=={{header|Ada}}==
| |||