1729, known as the Hardy–Ramanujan number, is the smallest positive integer that can be expressed as the sum of two cubes of positive integers in two ways (
12^3+1^3=10^3+9^3=1729). Given an integer
n (as input in whatever form is natural to your language of choice) find the smallest positive integer that can be expressed as the sum of two positive integers raised to the
nth power in two unique ways. No use of external sources. Fewest characters wins.
Note that this is actually an unsolved problem for
n>4. For those numbers, let your program run forever in search, or die trying! Make it so that if given infinite time and resources, the program would solve the problem.