RosettaCodeData/Task/Perfect-numbers/Haskell/perfect-numbers-1.hs
2014-04-02 16:56:35 +00:00

2 lines
61 B
Haskell

perfect n =
n == sum [i | i <- [1..n-1], n `mod` i == 0]