KnowraSieve theoryLinked fromLinked fromThe 16 pages that link to Sieve theory, each with the reason it gives.All 16Related 10Narrower topic 6Inclusion–exclusion principleRelated: Sieve methods use inclusion–exclusion to remove integers divisible by selected primes.Analytic number theoryRelated: Sieve estimates complement analytic methods for counting primes and almost-primes.Twin prime conjectureRelated: Sieve methods find many prime pairs but struggle to prove infinitely many exact pairs.Goldbach's conjectureRelated: Sieve methods constrain candidate prime pairs but have not settled the binary conjecture.Multiplicative functionRelated: Multiplicative weights help sieve methods track how divisibility conditions combine.Additive number theoryRelated: Sieve methods isolate prime summands in additive representation problems.Hardy–Littlewood conjecturesRelated: Sieve methods formalize the removal of candidates divisible by small primes.Atle SelbergNarrower topic: Selberg’s sieve is a major method within this broader approach to prime distribution.Elliott–Halberstam conjectureNarrower topic: The conjecture’s motivation and many consequences are expressed through sieve estimates.Twin primeNarrower topic: Sieve methods estimate twin-prime counts and underpin major bounded-gap results.Brun's theoremNarrower topic: Brun's proof belongs to the broader family of sieve methods.Artin's conjecture on primitive rootsNarrower topic: Hooley's argument combines sieve ideas with estimates for primes and orders.Friedlander–Iwaniec theoremNarrower topic: The theorem adapts sieve methods to the sparse values of a² + b⁴.Goldbach–Euler theoremRelated: Sieve methods produce strong near-results, including Chen’s theorem.Grimm's conjectureRelated: Sieve estimates provide tools for studying primes among the divisors of nearby integers.Lemoine's conjectureRelated: Sieve methods help analyze how often candidate summands can both be prime.
KnowraSieve theoryLinked fromLinked fromThe 16 pages that link to Sieve theory, each with the reason it gives.All 16Related 10Narrower topic 6Inclusion–exclusion principleRelated: Sieve methods use inclusion–exclusion to remove integers divisible by selected primes.Analytic number theoryRelated: Sieve estimates complement analytic methods for counting primes and almost-primes.Twin prime conjectureRelated: Sieve methods find many prime pairs but struggle to prove infinitely many exact pairs.Goldbach's conjectureRelated: Sieve methods constrain candidate prime pairs but have not settled the binary conjecture.Multiplicative functionRelated: Multiplicative weights help sieve methods track how divisibility conditions combine.Additive number theoryRelated: Sieve methods isolate prime summands in additive representation problems.Hardy–Littlewood conjecturesRelated: Sieve methods formalize the removal of candidates divisible by small primes.Atle SelbergNarrower topic: Selberg’s sieve is a major method within this broader approach to prime distribution.Elliott–Halberstam conjectureNarrower topic: The conjecture’s motivation and many consequences are expressed through sieve estimates.Twin primeNarrower topic: Sieve methods estimate twin-prime counts and underpin major bounded-gap results.Brun's theoremNarrower topic: Brun's proof belongs to the broader family of sieve methods.Artin's conjecture on primitive rootsNarrower topic: Hooley's argument combines sieve ideas with estimates for primes and orders.Friedlander–Iwaniec theoremNarrower topic: The theorem adapts sieve methods to the sparse values of a² + b⁴.Goldbach–Euler theoremRelated: Sieve methods produce strong near-results, including Chen’s theorem.Grimm's conjectureRelated: Sieve estimates provide tools for studying primes among the divisors of nearby integers.Lemoine's conjectureRelated: Sieve methods help analyze how often candidate summands can both be prime.