Multiplicatively perfect numbers: Difference between revisions
m
→{{header|Ring}}: for m = 2 to ceil(sqrt(n))+1 is wrong
Tag: Undo |
m (→{{header|Ring}}: for m = 2 to ceil(sqrt(n))+1 is wrong) |
||
Line 8:
<br>
{{incorrect|Ring|program doesn't find all divisors for n}}
=={{header|Ring}}==
<syntaxhighlight lang="ring">
| |||