Skip to content
Register Sign in Wishlist
The Algorithmic Resolution of Diophantine Equations

The Algorithmic Resolution of Diophantine Equations
A Computational Cookbook

$67.95 (P)

Part of London Mathematical Society Student Texts

  • Date Published: January 1999
  • availability: Available
  • format: Paperback
  • isbn: 9780521646338

$ 67.95 (P)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing 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 that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, 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 interested in solving diophantine equations using computational methods.

    • Introduction to an area of rapid growth
    • Gives readers sufficient grounding so that they can go on to read research literature in this subject
    • Suitable for graduate students of number theory
    Read more

    Reviews & endorsements

    "It is high time for such a book to appear...professional mathematicians and even experts in the subject will find it useful as well...Smart did a good job,and his book will efficiently serve as a textbook for beginners and as a reference source for the experts." Mathematical Reviews

    "It is a real pleasure to read this book, mainly because the author gives many examples and many practical remarks concerning the effective solution of diophantine equations. ...this is a very attractive book, full of concrete information, which gives a very clear and lucid view of the current knowledge." Bulletin of the AMS

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 1999
    • format: Paperback
    • isbn: 9780521646338
    • length: 260 pages
    • dimensions: 229 x 152 x 15 mm
    • weight: 0.39kg
    • availability: Available
  • Table of Contents

    1. Introduction
    Part I. Basic Solution Techniques:
    2. Local methods
    3. Applications of local methods to diophantine equations
    4. Ternary quadratic forms
    5. Computational diophantine approximation
    6. Applications of the LLL-algorithm
    Part II. Methods Using Linear Forms in Logarithms:
    7. Thue equations
    8. Thue–Mahler equations
    9. S-Unit equations
    10. Triangularly connected decomposable form equations
    11. Discriminant form equations
    Part III. Integral and Rational Points on Curves:
    12. Rational points on elliptic curves
    13. Integral points on elliptic curves
    14. Curves of genus greater than one

  • Resources for

    The Algorithmic Resolution of Diophantine Equations

    Nigel P. Smart

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Author

    Nigel P. Smart, Hewlett-Packard Laboratories, Bristol

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.