Miller–Rabin primality test: Difference between revisions
Content added Content deleted
| Line 3,264: | Line 3,264: | ||
echo "\nprimemr?" |
echo "\nprimemr?" |
||
let num = |
let num = 5_000_000u # => 348_513 primes |
||
var primes: seq[uint] = @[] |
var primes: seq[uint] = @[] |
||
echo("find primes < ", num) |
echo("find primes < ", num) |
||
te = epochTime() |
te = epochTime() |
||
for n in 0u..num: |
for n in 0u..num: |
||
if n.primemr: primes.add(n) |
|||
stdout.write("\r",((float64(n) / float64(num))*100).formatFloat(ffDecimal, 1), "%") |
|||
echo("\nnumber of primes < ",num, " are ", primes.len) |
echo("\nnumber of primes < ",num, " are ", primes.len) |
||
echo (epochTime()-te).formatFloat(ffDecimal, 6) |
echo (epochTime()-te).formatFloat(ffDecimal, 6) |
||