Skip to main content

Montgomery’s Sieve

  • Chapter
  • First Online:
Excursions in Multiplicative Number Theory

Part of the book series: Birkhäuser Advanced Texts Basler Lehrbücher ((BAT))

  • 915 Accesses

Abstract

Sieving is all about extracting information from a sequence that is imbedded in a host sequence. The leading example is one of the primes: we start from the integers of the interval [1, x] and remove all the ones that are divisible by a prime not more than \(\sqrt{x}\). What remains are the primes from \((\sqrt{x},x]\) together with the integer 1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 39.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The notations \(\Omega _p\) and \(\omega (p)\) are standard. They bear no relation with the functions \(\Omega \) and \(\omega \) that count the number of prime factors with and, respectively, without multiplicity.

  2. 2.

    We take this opportunity to tell the readers that there are no known visual representation of Christian Goldbach, either drawing or painting, and that the ones that float on the web are all wrong (it is often Euler or H. Grassmann with specs, and sometimes it is B. Riemann).

References

  1. E. Bombieri. “Le grand crible dans la théorie analytique des nombres”. In: Astérisque 18 (1987/1974), 103pp (cit. on p. 288).

    Google Scholar 

  2. H.G. Diamond, H. Halberstam, and W.F. Galway. A higher-dimensional sieve method. Vol. 177. Cambridge tracts in mathematics. Cambridge University Press, 2008 (cit. on p. 288).

    Google Scholar 

  3. P.D.T.A. Elliott. “On maximal variants of the Large Sieve. II”. In: J. Fac. Sci. Univ. Tokyo, Sect. IA 39.2 (1992), pp. 379–383 (cit. on p. 285).

    Google Scholar 

  4. P. Erdös. “On integers of the form \(2^{k}\) p and some related problems”. In: Summa Brasil. Math. 2 (1950), pp. 113–123 (cit. on p. 288).

    Google Scholar 

  5. J.B. Friedlander and H. Iwaniec. Opera de cribro. Vol. 57. American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2010, pp. xx+527 (cit. on p. 288).

    Google Scholar 

  6. P.X. Gallagher, “A large sieve density estimate near \(\sigma = 1\)”. In: Invent. Math. 11 (1970), pp. 329–339. https://doi.org/10.1007/BF01403187 (cit. on p. 286).

  7. A. Granville, A.J. Harper, K. Soundararajan, “‘A new proof of Halász’s theorem, and its consequences”. In: Compos. Math. 155.1 (2019), pp. 126–163. https://doi.org/10.1112/s0010437x18007522 (cit. on p. 286).

  8. L. Habsieger, X.-F. Roblot, “On integers of the form p\(2^{k}\)”. In: Acta Arith. 122.1 (2006), pp. 45–50. https://doi.org/10.4064/aa122-1-4 (cit. on p. 288).

  9. H. Halberstam and H.-E. Richert. “Sieve methods”. In: Academic Press (London) (1974), 364pp (cit. on p. 288).

    Google Scholar 

  10. G.H. Hardy and J.E. Littlewood. “Some problems of “Partitio Numerorum” III. On the expression of a number as a sum of primes”. In: Acta Math. 44 (1922), pp. 1–70 (cit. on p. 287).

    Google Scholar 

  11. H.L. Montgomery. “A note on the large sieve”. In: J. London Math. Soc. 43 (1968), pp. 93–98 (cit. on p. 284).

    Google Scholar 

  12. H.L. Montgomery. “Topics in Multiplicative Number Theory”. In: Lecture Notes in Mathematics (Berlin) 227 (1971), 178pp (cit. on p. 288).

    Google Scholar 

  13. R.C. Montgomery H.L. nd Vaughan. “Hilbert’s inequality”. In: J. Lond. Math. Soc., II Ser. 8 (1974), pp. 73–82 (cit. on p. 286).

    Google Scholar 

  14. 14 O. Ramaré. Arithmetical aspects of the large sieve inequality. Vol. 1. Harish-Chandra Research Institute Lecture Notes. With the collaboration of D.S. Ramana. New Delhi: Hindustan Book Agency, 2009, pp. x+201 (cit. on p. 288).

    Google Scholar 

  15. L.G. Schnirelmann. “Über additive Eigenschaften von Zahlen”. In: Math. Ann. 107 (1933), pp. 649–690 (cit. on p. 288).

    Google Scholar 

  16. Jie Wu. “Chen’s double sieve, Goldbach’s conjecture and the twin prime problem“. In: Acta Arith. 114.3 (2004), pp. 215–273 (cit. on p. 287).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olivier Ramaré .

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ramaré, O. (2022). Montgomery’s Sieve. In: Excursions in Multiplicative Number Theory. Birkhäuser Advanced Texts Basler Lehrbücher. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-73169-4_29

Download citation

Publish with us

Policies and ethics