The Large Sieve

  • Harold Davenport
Part of the Graduate Texts in Mathematics book series (GTM, volume 74)

Abstract

The large sieve was first proposed by Linnik1 in a short but important paper of 1941. In a subsequent series of papers, Rényi developed the method by adopting a probabilistic attitude. His estimates were not optimal, and in 1965 Roth2 substantially modified Rényi’s approach to obtain an essentially optimal result. Bombieri3 further refined the large sieve, and used it to describe the distribution of primes in arithmetic progressions; this we shall discuss in the following section.

Keywords

Arithmetic Progression Probabilistic Attitude Subsequent Series Large Sieve Arithmetic Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dokl Akad. Nauk SSSR, 30, 292–294 (1941).Google Scholar
  2. 2.
    Mathematika, 12, 1–9 (1965).Google Scholar
  3. 3.
    Mathematika, 12, 201–225 (1965).Google Scholar
  4. 4.
    Amer. J. Math., 63, 361–370 (1941).Google Scholar
  5. 5.
    Mathematika, 13, 91–96 (1966); 14, 229–232 (1967).Google Scholar
  6. 6.
    Bull. Amer. Math. Soc., 84, 547–567 (1978).Google Scholar
  7. 7.
    Mathematika, 14, 14–20 (1967).Google Scholar
  8. 8.
    Abh. aus Zahlentheorie und Analysis zur Erinnerung an Edmund Landau, VEB Deutsch. Verlag Wiss., Berlin, 1968, 11–22.Google Scholar
  9. 9.
    J. London Math. Soc., 43, 93–98 (1968).Google Scholar
  10. 10.
    Izv. Akad. Nauk SSSR Ser. Mat., 12, 57–78 (1948); Amer. Math. Soc. Transi., (2)19, 299–321 (1962).Google Scholar
  11. 11.
    Mathematika, 14, 14–20 (1967).Google Scholar

Copyright information

© Ann Davenport 1980

Authors and Affiliations

  • Harold Davenport
    • 1
  1. 1.Cambridge UniversityCambridgeEngland

Personalised recommendations