Skip to content
Register Sign in Wishlist
Bounded Gaps Between Primes

Bounded Gaps Between Primes
The Epic Breakthroughs of the Early Twenty-First Century

c.$49.99 ( )

  • Publication planned for: March 2021
  • availability: Not yet published - available from March 2021
  • format: Paperback
  • isbn: 9781108799201

c.$ 49.99 ( )

Pre-order Add to wishlist

Other available formats:

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
  • Searching for small gaps between consecutive primes is one way to approach the twin primes conjecture, one of the most celebrated unsolved problems in number theory. This book documents the remarkable developments of recent decades, whereby an upper bound on the known gap length between infinite numbers of consecutive primes has been reduced to a tractable finite size. The text is both introductory and complete: the detailed way in which results are proved is fully set out and plenty of background material is included. The reader journeys from selected historical theorems to the latest best result, exploring the contributions of a vast array of mathematicians, including Bombieri, Goldston, Motohashi, Pintz, Yildirim, Zhang, Maynard, Tao and Polymath8. The book is supported by a linked and freely-available package of computer programs. The material is suitable for graduate students and of interest to any mathematician curious about recent breakthroughs in the field.

    • Lays out a path from the twentieth century to the best results of the twenty-first century, allowing readers to dip in and out
    • Gives introductory and supporting background proofs and results including Bessel functions, compact operators, complex analysis and Weil's theorem for curves
    • Includes software-engineered and documented computer programs so readers can attempt to improve the best results, for example by changing the code
    Read more

    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

    • Publication planned for: March 2021
    • format: Paperback
    • isbn: 9781108799201
    • dimensions: 244 x 170 mm
    • availability: Not yet published - available from March 2021
  • Table of Contents

    1. Introduction
    2. The sieves of Brun and Selberg
    3. Early work
    4. The breakthrough of Goldston, Motohashi, Pintz, and Yildirim
    5. The astounding result of Yitang Zhang
    6. Maynard's radical simplification
    7. Polymath's refinements of Maynard's results
    8. Variations on Bombieri–Vinogradov
    9. Further work and the epilogue
    Appendix A. Bessel functions of the first kind
    Appendix B. A type of compact symmetric operator
    Appendix C. Solving an optimization problem
    Appendix D. A Brun–Titchmarsh inequality
    Appendix E. The Weil exponential sum bound
    Appendix F. Complex function theory
    Appendix G. The dispersion method of Linnik
    Appendix H. One thousand admissible tuples
    Appendix I. PGpack mini-manual

  • Author

    Kevin Broughan, University of Waikato, New Zealand
    Kevin Broughan is Emeritus Professor at the University of Waikato, New Zealand. He co-founded and is a Fellow of the New Zealand Mathematical Society. Broughan brings a unique set of knowledge and skills to this project, including number theory, analysis, topology, dynamical systems and computational mathematics. He previously authored the two-volume work Equivalents of the Riemann Hypothesis (Cambridge, 2017) and wrote a software package which is part of Goldfeld's Automorphic Forms and L-Functions for the Group GL(n,R) (Cambridge, 2006).

Sign In

Please sign in to access your account


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

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 ×

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.