On the Diophantine equation x^2+p^2k+1=4y^n
From MaRDI portal
Publication:700923
Summary: It has been proved that if \(p\) is an odd prime, \(y>1\), \(k\geq 0\), \(n\) is an integer greater than or equal to \(4\), \((n,3h)=1\) where \(h\) is the class number of the field \(\mathbb{Q}(\sqrt{-p})\), then the equation \(x^{2}+p^{ 2k+1}=4y^{n}\) has exactly five families of solution in the positive integers \(x\), \(y\). It is further proved that when \(n=3\) and \(p=3a^{2}\pm 4\), then it has a unique solution \(k=0\), \(y=a^{2}\pm 1\).
Recommendations
Cited in
(11)- On the diophantine equation \(x^ 2+D=4p^ n\)
- On the diophantine equation \(x^ 2-D=4p^ n\)
- The diophantine equation \(x^ 2 + 2^ k = y^ n\)
- scientific article; zbMATH DE number 6703495 (Why is no real title available?)
- scientific article; zbMATH DE number 7404187 (Why is no real title available?)
- On a diophantine equation
- scientific article; zbMATH DE number 1932231 (Why is no real title available?)
- On the Diophantine equation \(x^2+11^{2k+1}=y^n\)
- On the Diophantine equation \(x^2+q^{2k+1}=y^n\)
- Power values of certain quadratic polynomials
- On the Diophantine equation \(x^2 + p^{2k} = y^n\)
This page was built for publication: On the Diophantine equation \(x^{2}+p^{2k+1}=4y^{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700923)