Abstract
Using properties of binary quadratic Diophantine equations, we prove that if \(r=p^{m} q^{n}\), where \(p, q\) are distinct odd primes and \(m, n\) are positive integers, then the equation \(x^{2}-\left(r^{2}+1\right) y^{2}=r^{2}\) has at most one positive integer solution \((x, y)\) with \(y \lt r-1\).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
