Solving the Pell Equation

• Κύριοι συγγραφείς: Jacobson, Michael J. (Συγγραφέας), Williams, Hugh C. (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2009.
• Σειρά: CMS Books in Mathematics,
• Θέματα: Mathematics.; Number theory.; Ecotoxicology.; Number Theory.

 Pell's equation is a very simple, yet fundamental Diophantine equation which is believed to have been known to mathematicians for over 2000 years. Because of its popularity, the Pell equation is often discussed in textbooks and recreational books concerning elementary number theory, but usually not in much depth. This book provides a modern and deeper approach to the problem of solving the Pell equation. The main component of this will be computational techniques, but in the process of deriving these it will be necessary to develop the corresponding theory. One objective of this book is to provide a less intimidating introduction for senior undergraduates and others with the same level of preparedness to the delights of algebraic number theory through the medium of a mathematical object that has fascinated people since the time of Archimedes. To achieve this, this work is made accessible to anyone with some knowledge of elementary number theory and abstract algebra. Many references and notes are provided for those who wish to follow up on various topics, and the authors also describe some rather surprising applications to cryptography. The intended audience is number theorists, both professional and amateur, and students, but we wish to emphasize that this is not intended to be a textbook; its focus is much too narrow for that. It could, however be used as supplementary reading for students enrolled in a second course in number theory. 

 Early History of the Pell Equation -- Continued Fractions -- Quadratic Number Fields -- Ideals and Continued Fractions -- Some Special Pell Equations -- The Ideal Class Group -- The Analytic Class Number Formula -- Some Additional Analytic Results -- Some Computational Techniques -- (f, p) Representations of -ideals -- Compact Representations -- The Subexponential Method -- Applications to Cryptography -- Unconditional Verification of the Regulator and the Class Number -- Principal Ideal Testing in -- Conclusion.