Jump to content

Perfect numbers: Difference between revisions

m
→‎{{header|Haskell}}: (minor tidying)
m (→‎{{header|Haskell}}: Moved a bracket, edited a comment.)
m (→‎{{header|Haskell}}: (minor tidying))
Line 1,164:
let lows = filter ((0 ==) . rem n) [1 .. floor (sqrt (fromIntegral n))]
in 1 < n &&
sumn ==
(lows ++quot
[ y(sum
| x <- (lows ++
, let y = n `quot` x[ y
, x /= y| x <- ])lows `quot`
2 , let y == quot n x
n , x /= y ]))
2
 
main :: IO ()
9,659

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.