Sieve of Eratosthenes: Difference between revisions
Content added Content deleted
(Eratosthenes for beginners) |
(Add BQN) |
||
Line 2,103:
@ ^ p3\" ":<
2 234567890123456789012345678901234567890123456789012345678901234567890123456789
=={{header|BQN}}==
A more efficient sieve (primes below one billion in under a minute) is provided as <code>PrimesTo</code> in bqn-libs [https://github.com/mlochbaum/bqn-libs/blob/master/primes.bqn primes.bqn].
<lang bqn>Primes β {
π©β€2 ? β0 ; # No primes below 2
p β πββnβπ© # Initial primes by recursion
b β 2β€βn # Initial sieve: no 0 or 1
E β {ββββΎ((π©Γπ©+β’)βΌ)n} # Multiples of π© under n, starting at π©Γπ©
/ b EβΈ{0Β¨βΎ(π¨βΈβ)π©}Β΄ p # Cross them out
}</lang>
{{out}}
<lang bqn> Primes 100
β¨ 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 β©
β βPrimesΒ¨ 10ββ7 # Number of primes below 1e0, 1e1, ... 1e6
β¨ 0 4 25 168 1229 9592 78498 β©
=={{header|Bracmat}}==
|