Abstract
Diophantine equations can often be reduced to various types of classical Thue equations. These equations usually have only very small solutions. On the other hand, to compute all solutions (i.e., to prove the nonexistence of large solutions) is a time-consuming procedure. Therefore, it is useful to have a fast algorithm to calculate the “small” solutions, especially if “small” means less than, e.g., 10100. Such an algorithm was constructed by A. Pethö in 1987 based on continued fractions.In the present paper, we construct a similar type of fast algorithm to calculate “small” solutions of relative Thue equations. Our method is based on the LLL reduction algorithm. We illustrate the method with explicit examples. The algorithm has several applications.
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.
