Skip to content

Due to scheduled maintenance, online ordering will not be available on this site from 10:00 until 22:00 GMT on Saturday 16th December. We apologise for the inconvenience.

Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
The Algorithmic Resolution of Diophantine Equations

The Algorithmic Resolution of Diophantine Equations
A Computational Cookbook

£40.99

Part of London Mathematical Society Student Texts

  • Date Published: November 1998
  • availability: Available
  • format: Paperback
  • isbn: 9780521646338

£ 40.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • 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

    '… should certainly establish itself as a key reference for established researchers and a natural starting point for new PhD students in the area.' E. V. Flynn, Bulletin of the London Mathematical Society

    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: November 1998
    • format: Paperback
    • isbn: 9780521646338
    • length: 260 pages
    • dimensions: 229 x 152 x 15 mm
    • weight: 0.39kg
    • availability: Available
  • Table of Contents

    Preface
    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
    Appendices
    References
    Index.

  • Resources for

    The Algorithmic Resolution of Diophantine Equations

    Nigel P. Smart

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to lecturers adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email lecturers@cambridge.org

  • Author

    Nigel P. Smart, Hewlett-Packard Laboratories, Bristol

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

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

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 www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

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

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.
×