
In
number theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example ...
, the Selberg sieve is a technique for estimating the size of "sifted sets" of
positive integer
In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positiv ...
s which satisfy a set of conditions which are expressed by
congruences. It was developed by
Atle Selberg
Atle Selberg (14 June 1917 – 6 August 2007) was a Norwegian mathematician known for his work in analytic number theory and the theory of automorphic forms, and in particular for bringing them into relation with spectral theory. He was awarded ...
in the 1940s.
Description
In terms of
sieve theory
Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The prototypical example of a sifted set is the set of prime numbers up to some prescribed limi ...
the Selberg sieve is of ''combinatorial type'': that is, derives from a careful use of the
inclusion–exclusion principle
In combinatorics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union (set theory), union of two finite sets; symbolically expressed as
: , A \cup B, ...
. Selberg replaced the values of the
Möbius function
The Möbius function \mu(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and m ...
which arise in this by a system of weights which are then optimised to fit the given problem. The result gives an ''upper bound'' for the size of the sifted set.
Let
be a set of positive integers
and let
be a set of primes. Let
denote the set of elements of
divisible by
when
is a product of distinct primes from
. Further let
denote
itself. Let
be a positive real number and
denote the product of the primes in
which are
. The object of the sieve is to estimate
:
We assume that , ''A''
''d'', may be estimated by
:
where ''f'' is a
multiplicative function
In number theory, a multiplicative function is an arithmetic function f of a positive integer n with the property that f(1)=1 and
f(ab) = f(a)f(b) whenever a and b are coprime.
An arithmetic function is said to be completely multiplicative (o ...
and ''X'' = , ''A'', . Let the function ''g'' be obtained from ''f'' by
Möbius inversion, that is
:
:
where μ is the
Möbius function
The Möbius function \mu(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and m ...
.
Put
:
Then
:
where