Carmichael 3 strong pseudoprimes: Difference between revisions

Content added Content deleted

Inline

@@ Line 79: / Line 79: @@
 =={{header|D}}==
-<lang d>enum mod = (in int n, in int m) pure nothrow => ((n % m) + m) % m;
+<lang d>enum mod = (in int n, in int m) pure nothrow @nogc=> ((n % m) + m) % m;
-bool isPrime(in uint n) pure nothrow {
+bool isPrime(in uint n) pure nothrow @nogc {
   if (n == 2 || n == 3)
     return true;