Finding $a,b$ such that $a^{n} + b^{n} $ is $(n+1)^{th}$ power Can we find all positive integers $a,b$ such that $a^{n}+b^{n}$ is an $(n+1)^{th}$ power? I think this question equivalent to solving the statement $$a^{n} + b^{n} = c^{n+1}$$ for $a,b,c \in \mathbb{N}$. But i don't know as to how i can solve this.
I attempted by subsituting $n$ as $n+1$ so that we get $$a^{n+1} + b^{n+1} = c^{n+2} = c \times c^{n+1}=(a^{n}+b^{n}) \cdot c$$
but it seems that this doesn't help!
 A: When $n = 2$ it's straightforward to give a more-or-less complete solution: $c^3$ is a sum of squares if and only if $c$ is, so write $c = d^2 + e^2$ and the rest is factorization over the Gaussian integers.  
For all $n$ there is the family of solutions $a = x(x^n + y^n), b = y(x^n + y^n), c = x^n + y^n$ for integers $x, y$.  But I think finding all solutions is likely to be incredibly hard.  
A: The hard case is relatively prime solutions. For $n > 2$ it is conjectured that there are no solutions.  This follows from the more precise conjecture that there are no relatively prime solutions to $x^a + y^b = z^c$ in the hyperbolic case $1/a + 1/b + 1/c < 1$ other than the ten or so examples found by Beukers and Zagier in a computer search (there are large solutions with $(a,b,c)=(2,3,7)$ and a few others) shortly after Wiles announced the proof of Fermat's Last Theorem.   It was proven by Darmon and Granville that the number of relatively prime solutions is finite for any given $n > 2$, and this required the Mordell conjecture (Faltings' theorem) on finiteness of rational points on curves of genus $g \geq 2$.  There is no known elementary approach to these questions, and resolution of the problem for particular values of $(a,b,c)$ uses the full machinery of modern algebraic geometry and number theory. 
A: For $n \ge 3$, the Fermat-Catalan conjecture (http://en.wikipedia.org/wiki/Fermat–Catalan_conjecture) implies that there are only finitely many solutions to your equation. (But the Fermat-Catalan conjecture is just a conjecture!)
Edit: as pointed out by yrudoy, this doesn't actually follow. I still think there should be only finitely many solutions, though, based on some probabilistic considerations. See for example Noam Elkies, The ABCs of Number Theory, in vol. 1, issue 1 of the Harvard College Mathematics Review, p. 61. (This gives a standard heuristic argument for Fermat's last theorem only having finitely many solutions for each $n \ge 4$, which adapts to this case.
A: A few to start you off:  for n=1 there are many solutions.  a=b=c=2 works for all n.  There is http://en.wikipedia.org/wiki/Fermat%27s_theorem_on_sums_of_two_squares.  You can apply that to c^3 to see if all factors of c which are 3 mod 4 come with even exponents you can solve it.  I suspect that is it as there just aren't that many powers to choose from, but don't have a proof.
A: Just to say that you can generate all the integer solutions to $a^n+b^n=c^{n+1}$ from the integer solutions to $v^n+w^n\equiv 0\bmod u^{n+1}$.

*

*Generating all the rational solutions is trivial: take any $A,B$, let $c=A^n+B^n$, then $(Ac)^n+(Bc)^n=c^{n+1}$.


*When is it an integer solution? I'll assume that $AB\ne 0$. Write $A=v/u,\gcd(u,v)=1$.
To get $c\in \Bbb{Z}$ it must be that $B=w/u,\gcd(u,w)=1$,
So $c=\frac{v^n+w^n}{u^n},Ac=\frac{v(v^n+w^n)}{u^{n+1}},Bc=\frac{w(v^n+w^n)}{u^{n+1}}$, and these are integers iff $v^n+w^n\equiv 0\bmod u^{n+1}$.
