large sieve
E1563187
UNEXPLORED
The large sieve is a powerful analytic number theory technique that provides upper bounds for the distribution of sequences in arithmetic progressions and related sieve problems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| large sieve canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22965137 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: large sieve Context triple: [Le Grand Crible dans la Théorie Analytique des Nombres, appliesMethod, large sieve]
-
A.
Selberg sieve
The Selberg sieve is a powerful analytic number theory method developed by Atle Selberg for estimating the size of sets of integers filtered by divisibility conditions, particularly in the study of prime numbers.
-
B.
Brun sieve
The Brun sieve is a combinatorial method in analytic number theory, developed by Viggo Brun, used to estimate the distribution of prime numbers and almost-primes in various sequences.
-
C.
Brun combinatorial sieve
The Brun combinatorial sieve is a classical number-theoretic sieving method, developed by Viggo Brun, that uses combinatorial techniques to estimate the distribution of integers free of small prime factors and was historically applied to problems like twin primes.
-
D.
Siegel–Walfisz theorem
The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
-
E.
Hardy–Littlewood circle method
The Hardy–Littlewood circle method is a powerful analytic number theory technique that uses complex analysis and Fourier series to study additive problems such as Waring’s problem and the Goldbach conjecture.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: large sieve Target entity description: The large sieve is a powerful analytic number theory technique that provides upper bounds for the distribution of sequences in arithmetic progressions and related sieve problems.
-
A.
Selberg sieve
The Selberg sieve is a powerful analytic number theory method developed by Atle Selberg for estimating the size of sets of integers filtered by divisibility conditions, particularly in the study of prime numbers.
-
B.
Brun sieve
The Brun sieve is a combinatorial method in analytic number theory, developed by Viggo Brun, used to estimate the distribution of prime numbers and almost-primes in various sequences.
-
C.
Brun combinatorial sieve
The Brun combinatorial sieve is a classical number-theoretic sieving method, developed by Viggo Brun, that uses combinatorial techniques to estimate the distribution of integers free of small prime factors and was historically applied to problems like twin primes.
-
D.
Siegel–Walfisz theorem
The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
-
E.
Hardy–Littlewood circle method
The Hardy–Littlewood circle method is a powerful analytic number theory technique that uses complex analysis and Fourier series to study additive problems such as Waring’s problem and the Goldbach conjecture.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
“Le Grand Crible dans la Théorie Analytique des Nombres”