Perfect numbers: Difference between revisions

m
(→‎{{header|PL/M}}: Added alternative much faster version, translated from Action!)
Line 534:
integer sum, f1, f2;
sum := 1;
f1 := 21;
for f1 := f1 + 1 while (f1 * f1) < n do
begin
if mod(n, f1) = 0 then
Line 543:
if f2 > f1 then sum := sum + f2;
end;
f1 := f1 + 1end;
end;
isperfect := (sum = n);
end;
211

edits