Ultra useful primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 33: / Line 33: @@
         LONG LONG INT two up 2 up n = LONG LONG INT( 2 ) ^ ( 2 ^ n );
         FOR i BY 2
-        WHILE BOOL found a prime = is probably prime( two up 2 up n - i );
+        WHILE IF is probably prime( two up 2 up n - i ) THEN
-              IF found a prime THEN
                   # found a sequence member #
                   print( ( " ", whole( i, 0 ) ) );