On the Diophantine equation \(x^2+D^m=p^n\) (Q2565547)

Let \(D>2\) and \(p\) an odd prime which does not divide \(D\). The authors prove that -- except in the two cases \((D,p)= (4,5),\,(2,5)\) -- the Diophantine equation \(x^2+D^m=p^n\) has at most two positive solutions \((x,mn)\). Notice that the equations \(x^2+4^m=5^n\) and \(x^2+4^m=5^n\) have exactly three solutions. The proof uses a deep result of Bilu-Hanrot-Voutier on primitve divisors of Lucas-Lehmer sequences and elementary arguments, in particular the computation of suitable Jacobi symbols (a classical method for this kind of equations).