Anonymous user
Carmichael 3 strong pseudoprimes: Difference between revisions
Updated D entry
(Updated D entry) |
|||
Line 79:
=={{header|D}}==
<lang d>enum mod = (in int n, in int m) pure nothrow @nogc=> ((n % m) + m) % m;
bool isPrime(in uint n) pure nothrow @nogc {
if (n == 2 || n == 3)
return true;
|