Miller–Rabin primality test: Difference between revisions

m
Line 494:
{{trans|Ruby}}
<lang d>import std.random;
 
bool isProbablePrime(ulong n, int k) {
if (n < 2 || n % 2 == 0)
Line 505 ⟶ 506:
}
assert(2 ^^ s * d == n - 1);
 
outer:
foreach (_; 0 .. k) {
Line 518 ⟶ 520:
return false;
}
 
return true;
}
Anonymous user