On the Diophantine equation \(x^2+q^{2k+1}=y^n\) (Q696930): Difference between revisions

It is proved that if \(q\) is an odd prime, \(q \not \equiv 7 \pmod 8\), \(n\) is an odd integer \(> 5\), \(n\) is not a multiple of 3 and \((h,n) = 1\), where \(h\) is the class number of the field \( \mathbb{Q}(\sqrt{-q})\), then the Diophantine equation \(x^2 + q^{2k+1} = y^n\) has exactly two families of solutions \((q,n,k,x,y)\).