/*
* Solution to Project Euler problem 29
* Copyright (c) Project Nayuki. All rights reserved.
*
* https://www.nayuki.io/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
import java.math.BigInteger;
import java.util.HashSet;
import java.util.Set;
public final class p029 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p029().run());
}
/*
* We generate all the possible powers in the given range, put each value
* into a set, and let the set count the number of unique values present.
*/
public String run() {
Set