Primality by Wilson's theorem: Difference between revisions

Content added Content deleted

Inline

@@ Line 129: / Line 129: @@
     %         allow numbers whose factorial won't fit in 32 bits        %
     logical procedure isWilsonPrime ( integer value n ) ;
-    if n < 2 then false
+        if n < 2 then false
-    else begin
+        else begin
-        integer factorialModN;
+            integer factorialModN;
-        factorialModN := 1;
+            factorialModN := 1;
-        for i := 2 until n - 1 do factorialModN := ( factorialModN * i ) rem n;
+            for i := 2 until n - 1 do factorialModN := ( factorialModN * i ) rem n;
-        factorialModN = n - 1
+            factorialModN = n - 1
-    end isWilsonPrime ;
+        end isWilsonPrime ;
     for i := 1 until 100 do if isWilsonPrime( i ) then writeon( i_w := 1, s_w := 0, " ", i );