Abstract
Let $p$ be a prime and $m$ a positive integer. In this paper, it is shown that the equation in the title has at most four solutions in positive integers $(X, Y)$.
Citation
Bo He. Alain Togbé. Pingzhi Yuan. "On the diophantine equation $X^2-(p^{2m}+1)Y^6=-p^{2m}$." Funct. Approx. Comment. Math. 43 (1) 31 - 44, September 2010. https://doi.org/10.7169/facm/1285679144
Information