Brun sieve
Builds on Möbius functionNumber of distinct prime factorsSieve of Eratosthenes
Definition
Let be a finite set of integers, let be a set of primes and let be real. Let be the product of the primes with . For let . The sifting function is Let be the Möbius function and the number of distinct prime factors of . The Brun sieve in its simplest form, Brun's pure sieve, uses the truncated sums together with the inequalities, valid for every integer ,
Remarks
Example: let , let be all primes and , so . Then . Here and , so ; and . The inequalities are the Bonferroni inequalities: for , the partial sums are for even and for odd . Non-example: the full Legendre sum with is exact, but it is not a truncation. It has terms, and the errors in approximating each add up. Brun's later, more refined sieve replaces the condition by conditions on the sizes of the prime factors of .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Möbius function concept
- Number of distinct prime factors concept
- Sieve of Eratosthenes concept
- Brun sieve definition
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 4G65M0ZWAZ |
|---|---|
| URI | m2://4G65M0ZWAZ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11N35, 11N36 |
| Defines | Brun sieve |
| Uses | Möbius function, Number of distinct prime factors, Sieve of Eratosthenes |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.