euler/Problem056.hs

4 lines
206 B
Haskell

-- Considering natural numbers of the form, ab, where a, b < 100, what is the maximum digital sum?
import Euler
main = print $ maximum $ [ sum (toDigits (a^b) :: [Integer]) | a <- [1..100], b <- [1..100] ]