Number theory Analytic number theory Concept
Large sieve
Summary
The large sieve is a method of analytic number theory. It applies when a set of integers is sifted by many residue classes modulo each prime. Its core is an inequality for exponential sums: a trigonometric polynomial cannot be large at many well-spaced points at once. In arithmetic form it bounds the size of a set of integers that misses many residue classes modulo many primes. It is a key tool in the proof of the Bombieri–Vinogradov theorem.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | N15YK7XG1H |
|---|---|
| URI | m2://N15YK7XG1H |
| Kind | concept |
| Writing | W0 stub |
| MSC | 11N35, 11N36 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.