From charlesreid1

Revision as of 12:43, 19 April 2025 by Unknown user (talk) (→‎Problem Statement)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem Statement

Consider integer combinations of a^b for 2 <= a <= 5 and 2 <= b <= 5:

There are 16 distinct powers, but they make 15 distinct numbers (2^4 and 4^2 are both the same)

How many distinct terms are generated by a^b for 2 <= a <= 100 and 2 <= b <= 100?

Solution

Code: https://git.charlesreid1.com/cs/euler/src/branch/master/java/Problem029.java

Flags