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.^[1] 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.

The load-bearing residual is not the broad topic of analytic number theory. It is the domain-specific identity determined 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 are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: 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 evidential layer asks what observation or proof warrants the claim: 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. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Brun sieve, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

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.

Structural Signature¶

Carrier: the typed analytic number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact analytic number theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Brun sieve
Constitutive operation: 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.
Invariant: 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
Recognition test: 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
Output or consequence: recognizing and comparing instances of Brun sieve, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of analytic number theory. The field contains many questions and methods that do not instantiate Brun sieve.
It is not its most familiar example. A canonical instance directly demonstrates 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. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Selberg sieve. The Selberg sieve optimizes quadratic weights for strong upper bounds; Brun's sieve uses combinatorial inclusion-exclusion and historically precedes the modern weighted framework.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Brun sieve must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside analytic number theory, the vocabulary and validity conditions do not transfer literally.

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. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact analytic number theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Brun sieve are converted, constrained, or organized by 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..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Brun sieve must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Brun sieve, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

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. A bare label is insufficient because the name Brun sieve can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact analytic number theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Brun sieve, the structure counts as Brun sieve exactly when 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.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

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.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Brun sieve. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

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. This step prevents the canonical example from becoming the definition.
Derive consequences. From 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, infer recognizing and comparing instances of Brun sieve, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Brun sieve must control the decision and an object that resembles Brun sieve in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

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. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates 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. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Brun sieve, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates 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. The example exposes the carrier and directly tests 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; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed analytic number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is 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 invariant is 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; and the result supports recognizing and comparing instances of Brun sieve, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing 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 destroys the classification.

Mapped back: 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. → 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 → recognizing and comparing instances of Brun sieve, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—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—can be run and because the same failure boundary—the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Brun sieve, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Brun sieve, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from analytic number theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, 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., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Brun sieve, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Brun sieve, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in analytic number theory.

This entry is a kind of Structural Filtering.

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.

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

Not to Be Confused With¶

Selberg sieve. The Selberg sieve optimizes quadratic weights for strong upper bounds; Brun's sieve uses combinatorial inclusion-exclusion and historically precedes the modern weighted framework.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Brun sieve. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Brun sieve. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Viggo Brun, 'Über das Goldbachsche Gesetz und die Anzahl der Primzahlpaare', Archiv for Mathematik og Naturvidenskab, 1915. registry ↩a ↩b

[2] Viggo Brun, 'La série \tfrac15 + \tfrac17 + \tfrac{1}{11} + \tfrac{1}{13} + \tfrac{1}{17} + \tfrac{1}{19} + \tfrac{1}{29} + \tfrac{1}{31} + \tfrac{1}{41} + \tfrac{1}{43} + \tfrac{1}{59} + \tfrac{1}{61} +\cdots où les dénominateurs sont "nombres premiers jumeaux" est convergente ou finie', Bulletin des Sciences Mathématiques, 1919. registry ↩a ↩b

[3] Alina Carmen Cojocaru, M. Ram Murty, 'An introduction to sieve methods and their applications', Cambridge University Press, 2005. registry ↩