Factorial primes: Difference between revisions
Content added Content deleted
(Added Algol 68) |
m (→{{header|ALGOL 68}}: (very) small tweak) |
||
| Line 43: | Line 43: | ||
FOR n WHILE fp count < 10 DO |
FOR n WHILE fp count < 10 DO |
||
f *:= n; |
f *:= n; |
||
IF LONG INT fp |
IF LONG INT fp = f - 1; |
||
is probably prime( fp ) |
is probably prime( fp ) |
||
THEN |
|||
fp count +:= 1; |
fp count +:= 1; |
||
show factorial prime( fp count, n, "-", fp ) |
show factorial prime( fp count, n, "-", fp ) |
||
FI; |
FI; |
||
IF LONG INT fp |
IF LONG INT fp = f + 1; |
||
is probably prime( fp ) |
is probably prime( fp ) |
||
THEN |
|||
fp count +:= 1; |
fp count +:= 1; |
||
show factorial prime( fp count, n, "+", fp ) |
show factorial prime( fp count, n, "+", fp ) |
||