Brun sieve¶

A combinatorial sieve that estimates integers avoiding specified prime divisibility conditions by truncating inclusion-exclusion with alternating upper and lower bounds.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3548
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Analytic Number Theory → Mathematics

Core Idea¶

Brun's pure sieve introduced weighted control of sifted sets and enabled results about almost primes, including convergence of the sum of reciprocals of twin primes, while lacking the parity resolution needed for primes themselves. Divisibility subsets are combined by inclusion-exclusion over square-free products; truncation and combinatorial weights bound the uncomputed remainder and produce upper or lower estimates for the sifted set. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Number Shaker

Picture all the numbers up to 100 in a big pile. You want to count the ones that aren't in the 2 times table, the 3 times table, the 5 times table and so on. Counting exactly is too hard, so the Brun sieve adds and takes away groups in a clever way and stops early. It can't give the exact count, but it can tell you 'at least this many' or 'at most this many'.

Bounding What the Sieve Leaves

A sieve in number theory is like a kitchen sieve for numbers: you shake out every number that can be divided by certain primes and see what is left. To count what's left exactly, you would add and subtract lots of groups (numbers divisible by 2, by 3, by both, and so on), but that gets out of control. Brun's sieve stops the adding and subtracting early and uses careful weights so it can still give solid upper or lower limits on how many numbers are left. With it, mathematicians could prove things about numbers that are 'almost prime', including that adding up 1 divided by each twin prime gives a finite total. But the method can't tell apart numbers with an even versus odd number of prime factors, so it can't count primes themselves.

Truncated Inclusion-Exclusion Sieve

A sieve method counts how many numbers in a set survive after removing those divisible by any of a chosen list of primes. The exact answer comes from inclusion-exclusion: you add and subtract counts of numbers divisible by products of distinct primes (square-free products). But the number of terms explodes, and each count has a small error, so the total error can swamp the answer. Brun's sieve solves this by truncating inclusion-exclusion and using combinatorial weights so that the leftover error is controlled, producing upper or lower bounds instead of an exact count. This let Brun prove results about almost primes and show that the sum of the reciprocals of twin primes converges. It has a built-in limit, called the parity problem: it can't distinguish numbers with an odd versus even number of prime factors well enough to count primes themselves.

Brun's sieve (Brun's pure sieve and its refinements) estimates the size of a sifted set: the elements of a finite sequence or weighted set that are not divisible by any prime in a sieving set up to some level. The exact count is given by inclusion-exclusion over square-free products of the sieving primes, weighted by divisibility counts, but the full expansion produces uncontrollable remainder terms. Brun truncated the expansion and introduced combinatorial weights so that the uncomputed remainder is bounded, yielding explicit upper or lower estimates for the sifted set under uniformity assumptions on the divisibility counts. This weighted control of sifted sets enabled results about almost primes, including the convergence of the sum of reciprocals of the twin primes. However, the method suffers from the parity limitation: it cannot distinguish integers with an odd number of prime factors from those with an even number, so it cannot by itself produce primes. A precise application states the sequence, sieving primes and level, divisibility counts and remainders, the weights, the direction of the bound, the uniformity assumptions and the parity limitation.

Scope of Application¶

Brun sieve belongs to analytic number theory and is useful where the analyst can specify the typed analytic number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the finite sequence or weighted set, sieving primes and level, divisibility counts and remainder terms, square-free products, inclusion-exclusion weights, upper or lower bound, uniformity assumptions, and parity limitation are explicit. The scope is broad within that domain but bounded by the need for the finite sequence or weighted set, sieving primes and level, divisibility counts and remainder terms, square-free products, inclusion-exclusion weights, upper or lower bound, uniformity assumptions, and parity limitation are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the finite sequence or weighted set, sieving primes and level, divisibility counts and remainder terms, square-free products, inclusion-exclusion weights, upper or lower bound, uniformity assumptions, and parity limitation are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Brun sieve. Brun sieve compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed analytic number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the finite sequence or weighted set, sieving primes and level, divisibility counts and remainder terms, square-free products, inclusion-exclusion weights, upper or lower bound, uniformity assumptions, and parity limitation are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of analytic number theory because they reuse the typed analytic number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Divisibility subsets are combined by inclusion-exclusion over square-free products; truncation and combinatorial weights bound the uncomputed remainder and produce upper or lower estimates for the sifted set., and type the carrier, state every parameter and convention in the definition, test that the finite sequence or weighted set, sieving primes and level, divisibility counts and remainder terms, square-free products, inclusion-exclusion weights, upper or lower bound, uniformity assumptions, and parity limitation are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Brun sieve Domain-specific

Parents (1) — outgoing typed relations

Brun sieve is a kind of Structural Filtering Prime

It remains its own entry because its identity is fixed by the finite sequence or weighted set, sieving primes and level, divisibility counts and remainder terms, square-free products, inclusion-exclusion weights, upper or lower bound, uniformity assumptions, and parity limitation.

Hierarchy path (1) — routes to 1 parentless root

Brun sieve → is a kind of Structural Filtering → is a kind of Selection

Neighborhood in Abstraction Space¶

Brun sieve sits in a crowded region of the domain-specific corpus (14^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Integer & Divisor Number Theory (45 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25