On the equation $x^2-2^m=y^n$

Abstract

In this article we finish the study of solutions of the equation $x^2-2^m=y^n$ for $m\in \mathbb{Z}$ and $n\ge 3$. This is achieved using the modularity method in unsolved cases, namely, we prove that the only integer solutions of $x^2-2=y^n$ for $n\ge 2$ are $(\pm 1,-1)$ when $n$ is odd.

arXiv commentMajor mistake. The paper has been withdrawn