Perfect numbers: Difference between revisions
Content added Content deleted
(→{{header|Perl 6}}: slightly less stupid algorithm) |
|||
| Line 693: | Line 693: | ||
(and (=0 (% N I)) (inc 'C I)) ) |
(and (=0 (% N I)) (inc 'C I)) ) |
||
(= C N) ) )</lang> |
(= C N) ) )</lang> |
||
=={{header|PL/I}}== |
|||
<lang PL/I> |
|||
perfect: procedure (n) returns (bit(1)); |
|||
declare n fixed; |
|||
declare sum fixed; |
|||
declare i fixed binary; |
|||
sum = 0; |
|||
do i = 1 to n-1; |
|||
if mod(n, i) = 0 then sum = sum + i; |
|||
end; |
|||
return (sum=n); |
|||
end perfect; |
|||
</lang> |
|||
=={{header|PowerShell}}== |
=={{header|PowerShell}}== |
||