On the Diophantine equation \(ax^2+by^2=ck^n\) (Q2566744): Difference between revisions

Let \(a\), \(b\), \(c\), and \(k\) be rational integers with \(\gcd(a,b)=\gcd(ab,ck)=1\). The author gives necessary and sufficient conditions for the solvability of the Diophantine equation \(ax^2+by^2=ck^n\) with \(\gcd(ax,by)=1\) in positive integers \(x\), \(y\), and \(n\). Furthermore, it is proved that the Diophantine equation \((a\pm1)x^2+(3a\mp 1)=4a^n\) with \(2\nmid n\) and fixed \(a\geq 3\) has no solution with \(n>3\). As a consequence, all three solutions to the Goormaghtigh equation \((x^3-1)/(x-1)=(y^n-1)/(y-1)\) with \(| x| >| y| >1\), \(n>3\), \(2\nmid n\) are given.