Abstract
Let a,b,c be fixed coprime positive integers with min{a,b,c}>1. In this paper, combining the Gel'fond–Baker method with an elementary approach, we prove that if max{a,b,c}>5×1027, then the equation ax+by=cz has at most three positive integer solutions (x,y,z).
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.
