Skip to content

Due to scheduled maintenance, if purchasing is normally available on this site, it will not be available from Saturday 18th November 07:00 GMT until Sunday 19th November 15:00 GMT. We apologise for the inconvenience.

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Primes and Programming

Primes and Programming

textbook
  • Date Published: September 1993
  • availability: Available
  • format: Paperback
  • isbn: 9780521409889

Paperback

Add to wishlist

Request inspection copy

Lecturers may request a copy of this title for inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Numbers are part of our everyday experience and their properties have fascinated mankind since ancient times. Deciding whether a number is prime and if not, what its factors are, are both fundamental problems. In recent years analysis and solution of these problems have assumed commercial significance since large primes are an essential feature of secure methods of information transmission. The purely mathematical fascination that led to the development of methods for primality testing has been supplemented by the need to test within reasonable timescales, and computational methods have entered at all levels of number theory. In this book, Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational exercises and projects (in addition to more usual theory exercises). The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely 'recreational' nature.

    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: September 1993
    • format: Paperback
    • isbn: 9780521409889
    • length: 252 pages
    • dimensions: 225 x 150 x 14 mm
    • weight: 0.38kg
    • contains: 12 b/w illus.
    • availability: Available
  • Table of Contents

    Preface
    1. The fundamental theorem, GCDs and LCMs
    2. Listing primes
    3. Congruences
    4. Powers and pseudoprimes
    5. Miller's test and strong pseudoprimes
    6. Euler's theorem, orders and primality testing
    7. Cryptography
    8. Primitive roots
    9. The number of divisors d and the sum of divisors
    10. Continued fractions and factoring
    11. Quadratic residues
    References
    Index.

  • Author

    Peter J. Giblin, University of Liverpool

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

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