Abstract
A method for direct construction of continued fraction elements, presenting a square root from a natural number, is proposed. This technique resembles the usual division process. Derivation of the computing procedures is based on the Euclidean algorithm, Fermat's and Euler's theorems on a sum of two squares, and formulation of the basic equation for the continued fraction elements as Diophantine equation. The solution of Pell equation is presented explicitly through the same functions, which describe the Euclidean algorithm and solutions to linear Diophantine equations. It is supposed that similar procedures could be used by Fermat when he challenged to solve the quadratic Diophantine equation for special difficult cases found by him.
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 callMore From: Journal of Computational Methods in Sciences and Engineering
Disclaimer: 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.
