Multiplicatively perfect numbers: Difference between revisions

no edit summary
m (→‎{{header|J}}: easier to read)
No edit summary
Line 298:
<pre>
Same as C example.
</pre>
 
=={{header|Haskell}}==
<syntaxhighlight lang=Haskell>
divisors :: Int -> [Int]
divisors n = [d | d <- [1..n] , mod n d == 0 ]
 
isMultiplicativelyPerfect :: Int -> Bool
isMultiplicativelyPerfect n = (product $ divisors n) == n ^ 2
 
solution :: [Int]
solution = filter isMultiplicativelyPerfect [1..500]
</syntaxhighlight>
{{out}}
<pre>
[1,6,8,10,14,15,21,22,26,27,33,34,35,38,39,46,51,55,57,58,62,65,69,74,77,82,85,86,87,91,93,94,95,106,111,115,118,119,122,123,125,129,133,134,141,142,143,145,146,155,158,159,161,166,177,178,183,185,187,194,201,202,203,205,206,209,213,214,215,217,218,219,221,226,235,237,247,249,253,254,259,262,265,267,274,278,287,291,295,298,299,301,302,303,305,309,314,319,321,323,326,327,329,334,335,339,341,343,346,355,358,362,365,371,377,381,382,386,391,393,394,395,398,403,407,411,413,415,417,422,427,437,445,446,447,451,453,454,458,466,469,471,473,478,481,482,485,489,493,497]
</pre>
 
258

edits