Miller–Rabin primality test: Difference between revisions
Content added Content deleted
Line 3,261: | Line 3,261: | ||
te = epochTime() |
te = epochTime() |
||
echo 18446744073709551533u64.primemr |
echo 18446744073709551533u64.primemr |
||
echo (epochTime()-te).formatFloat(ffDecimal, 6) |
|||
echo "\nprimemr?" |
|||
let num = 341_531u # => 29_306 primes |
|||
var primes: seq[uint] = @[] |
|||
echo("find primes < ", num) |
|||
te = epochTime() |
|||
for n in 0u..num: (if primemr n: primes.add(n)) |
|||
echo("\nnumber of primes < ",num, " are ", primes.len) |
|||
echo (epochTime()-te).formatFloat(ffDecimal, 6) |
echo (epochTime()-te).formatFloat(ffDecimal, 6) |
||
</lang> |
</lang> |