Brun combinatorial sieve
E865105
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Brun combinatorial sieve canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10462078 — 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: Brun combinatorial sieve Context triple: [Selberg sieve, contrastedWith, Brun combinatorial 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.
Selberg–Delange method results
Selberg–Delange method results are asymptotic formulas in analytic number theory that precisely describe the average order and distribution of multiplicative arithmetic functions using complex-analytic techniques.
-
C.
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.
-
D.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
E.
Dirichlet hyperbola method
The Dirichlet hyperbola method is a technique in analytic number theory used to estimate sums of arithmetic functions by splitting double sums along a hyperbola to obtain asymptotic formulas.
- 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: Brun combinatorial sieve Target entity description: 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.
-
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.
Selberg–Delange method results
Selberg–Delange method results are asymptotic formulas in analytic number theory that precisely describe the average order and distribution of multiplicative arithmetic functions using complex-analytic techniques.
-
C.
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.
-
D.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
E.
Dirichlet hyperbola method
The Dirichlet hyperbola method is a technique in analytic number theory used to estimate sums of arithmetic functions by splitting double sums along a hyperbola to obtain asymptotic formulas.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
analytic number theory tool
ⓘ
combinatorial sieve ⓘ number theory concept ⓘ sieve method ⓘ |
| aimsToEstimate |
density of sifted sets of integers
ⓘ
distribution of integers free of small prime factors ⓘ |
| appliedTo |
distribution of almost primes
ⓘ
integers without small prime factors ⓘ twin prime problem ⓘ |
| assumes | estimates for sums over primes ⓘ |
| belongsTo | classical sieve methods ⓘ |
| category | mathematical method ⓘ |
| contrastsWith |
Selberg sieve
NERFINISHED
ⓘ
large sieve inequality ⓘ |
| contributedTo | proof that sum of reciprocals of twin primes converges ⓘ |
| developedBy | Viggo Brun NERFINISHED ⓘ |
| developedInCentury | 20th century ⓘ |
| field |
analytic number theory
ⓘ
number theory ⓘ |
| focusesOn | integers free of small prime divisors ⓘ |
| framework | combinatorial sieving of sets of integers ⓘ |
| historicalSignificance | first effective combinatorial sieve for twin primes ⓘ |
| influenced | modern sieve theory ⓘ |
| languageOfOriginalWork | Norwegian ⓘ |
| namedAfter | Viggo Brun NERFINISHED ⓘ |
| originCountryOfDeveloper | Norway GENERATED ⓘ |
| provides |
lower bounds for sifted sets
ⓘ
upper bounds for sifted sets ⓘ |
| relatedTo |
Brun's constant
NERFINISHED
ⓘ
Brun's theorem NERFINISHED ⓘ Selberg sieve NERFINISHED ⓘ large sieve ⓘ sieve methods in number theory ⓘ sieve of Eratosthenes NERFINISHED ⓘ |
| studies | integers with restricted prime factors ⓘ |
| typicalInput | set of integers with arithmetic structure ⓘ |
| typicalOutput | bounds on size of sifted subset ⓘ |
| usedFor |
bounding number of almost primes up to x
ⓘ
bounding number of twin primes up to x ⓘ |
| usedIn |
additive number theory
ⓘ
multiplicative number theory ⓘ |
| uses |
combinatorial techniques
ⓘ
inclusion–exclusion principle ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Brun combinatorial sieve Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.