Theoremresearch
Large sieve inequality
Also called Rényi-Montgomery large sieve.
Bounds the number of residue classes avoided by a set of integers, with broad applications in sieve theory.
Bounds the number of residue classes avoided by a set of integers, with broad applications in sieve theory.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 516849 Edit this page History Report an error