The algorithmic resolution of diophantine equations / Nigel P. Smart.

By: Smart, Nigel P. (Nigel Paul), 1967-
Material type: TextTextSeries: London Mathematical Society student texts: 41.Publisher: New York : Cambridge University Press, 1998Description: 1 online resource (xvi, 243 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9781107089150; 1107089158; 9781107359994; 1107359996Subject(s): Diophantine equations | Équations diophantiennes | MATHEMATICS -- Number Theory | Diophantine equations | EQUAÇÕES DIOFANTINAS | Analyse diophantienne | Nombres p-adiques | Formes (mathématiques) | Arithmétique -- Problèmes et exercices | Algorithmus | Diophantische GleichungGenre/Form: Electronic books. | Electronic books. Additional physical formats: Print version:: Algorithmic resolution of diophantine equations.DDC classification: 512/.72 LOC classification: QA242 | .S69 1998ebOnline resources: Click here to access online Summary: Beginning with a brief introduction to algorithms and diophantine equations, this volume aims to provide a coherent account of the methods used to find all the solutions to certain diophantine equations, particularly those procedures which have been developed for use on a computer. The study is divided into three parts, the emphasis throughout being on examining approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems which can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, mainly focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers, with a basic knowledge of number theory, who are interested in solving diophantine equations using computational methods.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references (pages 231-239) and index.

Print version record.

Beginning with a brief introduction to algorithms and diophantine equations, this volume aims to provide a coherent account of the methods used to find all the solutions to certain diophantine equations, particularly those procedures which have been developed for use on a computer. The study is divided into three parts, the emphasis throughout being on examining approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems which can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, mainly focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers, with a basic knowledge of number theory, who are interested in solving diophantine equations using computational methods.

There are no comments for this item.

to post a comment.

Powered by Koha