challenge-171/deadmarshal/haskell/ch-1.hs


1
2
3
4
5
6
7
8
9
10
11

divisorsSum :: (Integral a) => a -> a
divisorsSum n = sum [x | x <- [1..(div n 2+1)], mod n x == 0]

abundantOddNumbers :: (Integral a) => [a]
abundantOddNumbers =
  [x | x <- [1..], divisorsSum x > x && mod x 2 /= 0]

main :: IO ()
main =
  print $ take 20 abundantOddNumbers