Integer solutions to the equation \(y^2=x(x^2\pm p^k)\) (Q1011061): Difference between revisions

Let \(p\) be a prime number and \(k\) an integer \(\geq 1\). In [\textit{K. Draziotis}, Math. Comp. 75, No. 255, 1493--1505 (2006; Zbl 1093.11020)] the integer solutions of the equation \(y^2 = x^3\pm p^kx\) have been determined. An integer solution of the above equation is called primitive if \(y > 0\) and \(p^2\) does not divide \(x\) and imprimitive otherwise. In this paper sharp estimates for the number of primitive solutions are given. Furthermore, it is proved, that if the Ankeny-Artin-Chowla conjecture is true, then all imprimitive integer solutions to the equation \(y^2 = x^3-p^kx\), with \(k = 0,1,2,3\), have \(y = 0\).