RosettaCodeData/Task/Perfect-numbers/Haskell/perfect-numbers-1.hs
2023-07-01 13:44:08 -04:00

2 lines
61 B
Haskell

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