Anonymous user
Perfect numbers: Difference between revisions
→{{header|Haskell}}: use list comprehension
m (Defined the "it" in the largest kinown perfect number.) |
(→{{header|Haskell}}: use list comprehension) |
||
Line 1,164:
let lows = filter ((0 ==) . rem n) [1 .. floor (sqrt (fromIntegral n))]
in 1 < n &&
lows
[ y | x <- lows, let y = n `quot` x, x /= y
`quot`
n
| |||