This book provides an overview of the main results and problems concerning Diophantine m-tuples, i.e., sets of integers or rationals with the property that the product of any two of them is one less than a square, and their connections with elliptic curves. It presents the contributions of famous mathematicians of the past, like Diophantus, Fermat and Euler, as well as some recent results of the author and his collaborators.
The book presents fragments of the history of Diophantine m-tuples, emphasising the connections between Diophantine m-tuples and elliptic curves. It is shown how elliptic curves are used in solving some longstanding problems on Diophantine m-tuples, such as the existence of infinite families of rational Diophantine sextuples. On the other hand, rational Diophantine m-tuples are used to construct elliptic curves with interesting Mordell-Weil groups, including curves of record rank with agiven torsion group. The book contains concrete algorithms and advice on how to use the software package PARI/GP for solving computational problems.
This book is primarily intended for researchers and graduate students in Diophantine equations and elliptic curves. However, it can be of interest to other mathematicians interested in number theory and arithmetic geometry. The prerequisites are on the level of a standard first course in elementary number theory. Background in elliptic curves, Diophantine equations and Diophantine approximations is provided.

Author: Andrej Dujella
Binding Type: Hardcover
Publisher: Springer
Published: 06/05/2024
Series: Developments in Mathematics #79
Pages: 335
Weight: 1.46lbs
Size: 9.21h x 6.14w x 0.81d
ISBN: 9783031567230
2024 Edition

About the Author
Andrej Dujella is a professor of mathematics at the University of Zagreb, Fellow of the Croatian Academy of Sciences and Arts and Doctor Honoris Causa of University of Debrecen. His research interests include Diophantine equations, elliptic curves, polynomial root separation, and applications of Diophantine approximation to cryptography.