Perfect numbers: Difference between revisions
Content added Content deleted
(Added Quackery.) |
|||
Line 2,927: | Line 2,927: | ||
{{Out}} |
{{Out}} |
||
<pre>[6, 28, 496, 8128]</pre> |
<pre>[6, 28, 496, 8128]</pre> |
||
=={{header|Quackery}}== |
|||
<code>factors</code> is defined at [http://rosettacode.org/wiki/Factors_of_an_integer#Quackery Factors of an integer]. |
|||
<lang Quackery> [ 0 swap witheach + ] is sum ( [ --> n ) |
|||
[ factors -1 pluck dip sum = ] is perfect ( n --> n ) |
|||
say "Perfect numbers less than 10000:" cr |
|||
10000 times |
|||
[ i^ 1+ perfect if [ i^ 1+ echo cr ] ] |
|||
</lang> |
|||
{{out}} |
|||
<pre>Perfect numbers less than 10000: |
|||
6 |
|||
28 |
|||
496 |
|||
8128 |
|||
</pre> |
|||
=={{header|R}}== |
=={{header|R}}== |