Duffinian numbers: Difference between revisions

m
m (→‎{{header|ALGOL 68}}: notes and comments)
Line 60:
FOR n FROM 2 TO UPB ds DO
IF INT nds = ds[ n ];
IF nds = n + 1 THEN TRUE ELSE gcd( n, nds ) /= 1 FI
OR gcd( n, nds ) /= 1
THEN
# n is prime or is not is relatively prime to its divisor sum #
ds[ n ] := 0
FI
3,022

edits