I am studying "Sieve Methods" by Halberstam and Richert and I'm kinda stuck. In chapter 2 "The Combinatorial Sieve", in the first chapter about a general Sieve method we want to prove a relation which acts as sort of an improvement of the Eratosthenes-Legendre Sieve, mainly relation (1.8) of the chapter: $$ S(A;B,z)=\sum_{d\mid{P(z)}}\mu(d)\chi(d)|{A_d}|-\sum_{d\mid{P(z)}}\sum_{\substack{p\mid{P(z)}\\ p<q(d)}}\mu(d)({\chi(d)-\chi(pd))}S(A_{pd};B,z)$$ where $\mu(d)$ is the well-known Mobius function, $\chi(d)$ any arithmetic function with $\chi(1)=1$, $$\sigma(n)=\sum_{d\mid{n}}\mu(d)\chi(d)$$ and $S(A;B,z)$ is the standard sieve setting: $A$ is a set of natural numbers, $A_d$ is all the elements in $A$ that are $\equiv0(\text{mod }d)$ and $B$ the set of primes such that we exclude all natural numbers in $A$ that have prime factors in $B$ that are less than $z$. It's easy to see that if we assume relation (1.5) $$S(A;B,z)=\sum_{d\mid{P(z)}}\mu(d)\chi(d)|{A_d}|-\sum_{\substack{d>1\\ d\mid{P(z)}}}\sigma(d)S(A_d;B^{(d)},z)$$ where $B^{(d)}=\{p\in{B}:p\nmid{d}\}$, then we need only prove that $$\sum_{\substack{d>1\\ d\mid{P(z)}}}\sigma(d)S(A_d;B^{(d)},z)=\sum_{d\mid{P(z)}}\sum_{\substack{p\mid{P(z)}\\ p<q(d)}}\mu(d)({\chi(d)-\chi(pd))}S(A_{pd};B,z)$$ The authors provide a proof but it doesn't really make sense for me. Specifically they use the facts that, for a prime $p$ dividing $d$: $$\sigma(d)=\sum_{\tau\mid{d/p}}\mu(\tau)({\chi(\tau)-\chi(p\tau)})$$ and for $2\leq{z_1}\leq{z}$, if $P(z_1,z)=P(z)/P(z_1)$ then $$S(A;B,z_1)=\sum_{\tau\mid{P(z_1,z)}}S(A_{\tau};B^{(\tau)},z)$$ From these two they prove relation (1.8) in a way that makes absolutely no sense to me. I have proven everything mentioned here on my own without issue except for relation (1.8). Can anybody explain how the facts I mentioned are meant to give us the result we want? Any help is appreciated, I've been stuck on this for three days now.
2026-03-25 14:28:53.1774448933
A general Sieve method
79 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail AtRelated Questions in ANALYTIC-NUMBER-THEORY
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Is there a trigonometric identity that implies the Riemann Hypothesis?
- question regarding nth prime related to Bertrands postulate.
- Alternating sequence of ascending power of 2
- Reference for proof of Landau's prime ideal theorem (English)
- Does converge $\sum_{n=2}^\infty\frac{1}{\varphi(p_n-2)-1+p_n}$, where $\varphi(n)$ is the Euler's totient function and $p_n$ the $n$th prime number?
- On the behaviour of $\frac{1}{N}\sum_{k=1}^N\frac{\pi(\varphi(k)+N)}{\varphi(\pi(k)+N)}$ as $N\to\infty$
- Analytic function to find k-almost primes from prime factorization
- Easy way to prove that the number of primes up to $n$ is $\Omega(n^{\epsilon})$
- Eisenstein Series, discriminant and cusp forms
Related Questions in SIEVE-THEORY
- Sieve of Eratosthenes : why $\sqrt n$ work?
- Bounding the number of semiprimes of the form $2p\pm1$
- Asymptotic relations of $x$ and $x/(\log\log x)$
- Modified sieve to find count all the divisors from 1 to n in o(n) time
- Finding Prime Factors of a number in $\log(n)$
- Probability that a random number avoids a set of prime divisors
- In the General Number Field Sieve, can we estimate the size of the matrix in terms of the number being factored?
- How to tell if a particular number will survive in this sieve?
- Generalization of Opperman's Conjecture
- How long would it take a computer to check that a number is not divisible by any 20-digit prime?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?