Abstract
TextWe present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations x4+axy+y3=0 has been an open question. We also present an elementary method that reduces the task of finding all integer solutions to a general three-monomial equation to the task of finding primitive solutions to equations with three monomials in disjoint variables. We identify a large class of three-monomial equations for which this method leads to a complete solution. Empirical data suggests that this class contains 100% of three-monomial equations as the number of variables goes to infinity. VideoFor a video summary of this paper, please visit https://youtu.be/ANsJvFTmDCE.
Sign-in/Register to access full text options 
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.
