Project Euler Problem 056


A googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.

Considering natural numbers of the form, ab, where a, b<100, what is the maximum digital sum?


Brute-force solution.

def digital_sum(n):
    return sum(int(c) for c in str(n))
if __name__ == '__main__':
    result = max(digital_sum(a ** b) for a in range(100) for b in range(100))
    print("The result is:", result)

The Python file is available for download here.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License