Factorial primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 51: / Line 51: @@
     FOR n WHILE fp count < 10 DO
         f *:= n;
-        IF  LONG INT fp = f - 1;
+        LONG INT fp := f - 1;
-            is prime( fp )
+        IF  is prime( fp )
         THEN
             fp count +:= 1;
             show factorial prime( fp count, n, "-", fp )
         FI;
-        IF  LONG INT fp = f + 1;
+        fp +:= 2;
-            is prime( f + 1 )
+        IF  is prime( fp )
         THEN
             fp count +:= 1;