Sieve theory

Sieve theory
Name	Sieve theory
Field	Number theory
Introduced	Antiquity; systematic development 19th–20th centuries
Notable figures	Eratosthenes, Adrien-Marie Legendre, Viggo Brun, Atle Selberg, G. H. Hardy, John Edensor Littlewood, Paul Erdős, Ivan Vinogradov, Heini Halberstam, Hans-Egon Richert, Enrico Bombieri, Alan Baker, Yuri Linnik, Kenneth F. Roth, Jean Bourgain

Sieve theory Sieve theory is a collection of combinatorial and analytic techniques in number theory for estimating the size of sets of integers filtered by divisibility constraints, especially to detect primes or almost-primes inside arithmetic sequences. Originating with ancient algorithms attributed to Eratosthenes and formalized by 19th‑ and 20th‑century contributors such as Adrien-Marie Legendre, Viggo Brun, and Atle Selberg, sieve methods connect to topics studied by G. H. Hardy, John Edensor Littlewood, Paul Erdős, and Ivan Vinogradov and have driven advances in results related to Goldbach conjecture, Twin prime conjecture, and distribution of primes in arithmetic progressions.

Introduction

Sieve theory studies procedures that remove integers having small prime factors to approximate sets of integers with restricted prime divisibility, a theme also central to work by Srinivasa Ramanujan, Chebyshev, Bernhard Riemann, and Leonhard Euler. Classic and modern sieves provide upper and lower bounds for counting functions; these methods intersect research by Heini Halberstam, Hans-Egon Richert, Enrico Bombieri, and Yitang Zhang. Sieve techniques often combine combinatorial inclusion–exclusion with analytic inputs from results due to Dirichlet, Edward W. Barnes, Pafnuty Chebyshev, and results on L‑functions influenced by Atle Selberg and Harald Cramér.

Fundamental concepts and notation

Basic notation includes counting functions like A(x) for set size up to x and notation for arithmetic progressions tied to work by Peter Gustav Lejeune Dirichlet and Émile Borel. The concept of a sifted set uses multiplicative functions related to the Möbius function studied by Apostol, and the inclusion–exclusion principle echoes combinatorial methods used by George Pólya and Paul Erdős. Parameters commonly used—sifting level, sieve dimension, remainder term—are central in formulations by Viggo Brun, Atle Selberg, Rosser, and Iwaniec. The role of character sums and exponential sums, tools refined by Boris Delone, I. M. Vinogradov, Enrico Bombieri, and Hugh L. Montgomery, supplies analytic input to control error terms and link to results of G. H. Hardy and John Edensor Littlewood.

Classical sieves (Eratosthenes, Legendre, Brun, Selberg)

The ancient procedure of Eratosthenes provides the prototype for systematic sieving used in many later constructions and influenced numerical work by Srinivasa Ramanujan. Adrien-Marie Legendre provided early analytic formulations and bounds in the spirit of classical polynomial congruences studied by Pierre de Fermat and Joseph-Louis Lagrange. Viggo Brun introduced the Brun sieve, yielding Brun’s theorem on twin almost‑primes, a breakthrough connected to techniques later used by Paul Erdős and Atle Selberg. Atle Selberg developed the Selberg sieve, notable for its flexible combinatorial weights and influence on subsequent contributions by A. Selberg's contemporaries such as Heini Halberstam and Hans-Egon Richert. Other classical improvements and variants owe to researchers including Rosser, I. M. Vinogradov, and Rosser and Schoenfeld.

Modern developments and large sieve methods

The large sieve, developed through contributions by Yu. V. Linnik, Atle Selberg, Enrico Bombieri, and refined by Hugh L. Montgomery and John Friedlander, uses analytic inequalities and Fourier techniques to bound sieved sets in arithmetic progressions and character families. This line of advance benefited from collaborations involving P. X. Gallagher, H. Davenport, and later investigators like Jean Bourgain and D. A. Goldston. Innovations include bilinear forms, sieve weights, and dispersion methods employed by Kumchev, J. Maynard, and Terence Tao (in related additive work). Integration with deep results on automorphic forms and L‑functions, developed in part by Roger Godement, Harish-Chandra, and Atle Selberg, expanded applicability to equidistribution problems studied by Peter Sarnak.

Applications in prime number theory and additive problems

Sieve methods underpin partial results on the Twin prime conjecture and the Goldbach conjecture, with milestone contributions by Chen Jingrun (Chen’s theorem), J. R. Chen, and modern refinements by Yitang Zhang, James Maynard, and collaborative projects like the Polymath Project. Sieves have been used to prove bounded gaps between primes and to produce almost‑prime values of polynomials, building on approaches of G. H. Hardy, John Edensor Littlewood, and Ivan Vinogradov for additive problems. Applications extend to distribution of primes in arithmetic progressions linked to Dirichlet, to sieving in algebraic number fields studied by Heath-Brown and Davenport, and to results on prime k‑tuples investigated by P. X. Gallagher and Robert Rankin.

Computational aspects and algorithmic sieves

Algorithmic implementations inspired by Eratosthenes appear in modern prime‑finding libraries and projects associated with Great Internet Mersenne Prime Search, PrimeGrid, and numerical work by R. Crandall and Carl Pomerance. Practical sieving algorithms—segmented sieves, wheel sieves, and distributed sieving—draw on engineering in projects at institutions such as Los Alamos National Laboratory and groups like PARI/GP developers. Complexity analyses have been informed by computational number theory researchers including John Brillhart, Eric Bach, and H. W. Lenstra; cryptanalytic considerations link sieve efficiency to standards studied by National Institute of Standards and Technology and security research by Bruce Schneier.

Category:Number theory