Miller–Rabin primality test: Difference between revisions

Content added Content deleted

Inline

@@ Line 508: / Line 508: @@
         if (modpow(a, d, n) == 1)
             return false;
-        foreach (i; 0 .. s+1) {
+        foreach (i; 0 .. s + 1) {
-            if (modpow(a, 2^^i * d, n) == n-1)
+            if (modpow(a, 2^^i * d, n) == n - 1)
                 return false;
         }
         return true;
     }
-    foreach (i; 0 .. k+1) {
+    foreach (_; 0 .. k + 1) {
         if (isComposite(uniform(2, n)))
             return false;