Multiplicatively perfect numbers: Difference between revisions
Content added Content deleted
(Added Algol 68) |
m (→{{header|ALGOL 68}}: fix comment) |
||
Line 37: | Line 37: | ||
FOR j FROM i + i BY i TO UPB pdc DO |
FOR j FROM i + i BY i TO UPB pdc DO |
||
pdc[ j ] +:= 1; |
pdc[ j ] +:= 1; |
||
IF prime[ m +:= 1 ] THEN # j is a prime multiple of |
IF prime[ m +:= 1 ] THEN # j is a prime multiple of i # |
||
pfc[ j ] +:= 1; |
pfc[ j ] +:= 1; |
||
IF i = m THEN # j is i squared # |
IF i = m THEN # j is i squared # |
||
Line 53: | Line 53: | ||
FOR n TO UPB pdc DO |
FOR n TO UPB pdc DO |
||
IF n = 1 OR pdc[ n ] = 3 THEN |
IF n = 1 OR pdc[ n ] = 3 THEN |
||
# n is 1 or has 3 proper divisors so is |
# n is 1 or has 3 proper divisors so is multiplicatively perfect # |
||
# number - see OEIS A007422 # |
# number - see OEIS A007422 # |
||
mp count +:= 1; |
mp count +:= 1; |