## Problem 56: Powerful digit sum

*Difficulty: Easy

Problem:

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*< 100, what is the maximum digital sum?

How to solve :

Well, I consider this is a warm up problem for me to solve be using Python. So the only solution that I came up with was Brute Force

Python 2

Solution took >700 ms (quite long though)

Advertisements

## Reply