Perfect numbers: Difference between revisions
m
→{{header|PL/I-80}}
No edit summary |
|||
Line 2,916:
sum = 1; /* 1 is a proper divisor of every number */
f1 = 2;
do while ((f1 * f1) <= n);
if mod(n, f1) = 0 then
do;
Line 2,939:
8128
4 perfect numbers were found
</pre>
=={{header|PowerShell}}==
| |||