Back to Project Euler

Previous Problem Next Problem

Problem 56: Powerful Digit Sum

A googol (\(10^{100}\)) is a massive number: one followed by one-hundred zeros; \(100^{100}\) 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, \(a^b\), where \(a, b \lt 100\), what is the maximum digital sum?

Solution

Another large digital sum problem, just like Problems 16 and 20 (the former of which has an almost identical title). Next.

Python Code

p56 = lambda C=100: max(sum(map(int, str(x**y))) for x in range(C) for y in range(C))

Previous Problem Next Problem

Back to Project Euler