Skip to content
Register Sign in Wishlist

A Higher-Dimensional Sieve Method
With Procedures for Computing Sieve Functions

$131.00 (C)

Part of Cambridge Tracts in Mathematics

  • Date Published: November 2008
  • availability: Available
  • format: Hardback
  • isbn: 9780521894876

$ 131.00 (C)

Add to cart 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
  • As probability and combinatorics have penetrated the fabric of mathematical activity, sieve methods have become more versatile and sophisticated and in recent years have played a part in some of the most spectacular mathematical discoveries. Nearly a hundred years have passed since Viggo Brun invented his famous sieve, and the use of sieve methods is constantly evolving. Many arithmetical investigations encounter a combinatorial problem that requires a sieving argument, and this tract offers a modern and reliable guide in such situations. The theory of higher dimensional sieves is thoroughly explored, and examples are provided throughout. A Mathematica® software package for sieve-theoretical calculations is provided on the authors' website. To further benefit readers, the Appendix describes methods for computing sieve functions.

    • Fully explains the theory of higher dimensional sieves using many examples
    • Modern and reliable guide for researchers needing to solve combinatorial problems with sieving arguments
    • Computational methods are explained in detail in an appendix and on the accompanying website
    Read more

    Reviews & endorsements

    "This is a well crafted book, with clear writing."
    Allen Stenger, MAA Reviews

    "It is to be recommended on the one hand for the serious student of the subject, and on the other for those who want a reference to the strongest available results for applications."
    D.R. Heath-Brown, Mathematical Reviews

    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: November 2008
    • format: Hardback
    • isbn: 9780521894876
    • length: 290 pages
    • dimensions: 235 x 155 x 20 mm
    • weight: 0.52kg
    • contains: 5 b/w illus. 15 tables
    • availability: Available
  • Table of Contents

    List of tables
    List of illustrations
    Part I. Sieves:
    1. Introduction
    2. Selberg's sieve method
    3. Combinatorial foundations
    4. The fundamental Lemma
    5. Selberg's sieve method (continued)
    6. Combinatorial foundations (continued)
    7. The case κ = 1: the linear sieve
    8. An application of the linear sieve
    9. A sieve method for κ > 1
    10. Some applications of Theorem 9.1
    11. A weighted sieve method
    Part II. Proof of the Main Analytic Theorem:
    12. Dramatis personae and preliminaries
    13. Strategy and a necessary condition
    14. Estimates of σκ (u) = jκ (u/2)
    15. The pκ and qκ functions
    16. The zeros of Π−2 and Ξ
    17. The parameters σκ and βκ
    18. Properties of Fκ and fκ
    Appendix 1. Methods for computing sieve functions

  • Resources for

    A Higher-Dimensional Sieve Method

    Harold G. Diamond, H. Halberstam, William F. Galway

    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

  • Authors

    Harold G. Diamond, University of Illinois, Urbana-Champaign
    Harold G. Diamond is Professor Emeritus in the Department of Mathematics at the University of Illinois at Urbana-Champaign.

    H. Halberstam, University of Illinois, Urbana-Champaign
    Heini Halberstam is Professor Emeritus in the Department of Mathematics at the University of Illinois at Urbana-Champaign.

    William F. Galway
    William F. Galway's research focuses on analytic and computational number theory. He is a member of the American Mathematical Society and of the Mathematical Association of America.

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.