Jump to content

Ultra useful primes: Difference between revisions

m
(Added Algol 68)
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 =IF is probably prime( two up 2 up n - i ); THEN
IF found a prime THEN
# found a sequence member #
print( ( " ", whole( i, 0 ) ) );
3,045

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.