"Trivial" assymptotic bound in Gallagher's paper

76 Views Asked by At

In his paper On the distribution of primes in short intervals, right before equation 9, Gallagher states that $$\sum_{d|D}\frac{\mu^2(d)*C^{\omega(d)}}{\phi(d)}\sum_{\substack{e\gt x/d \\ \text{(e,D)=1}}}\frac{\mu^2(e)*C^{\omega(e)}}{\phi^2(e)}\ll\sum_{d|D}\frac{\mu^2(d)*C^{\omega(d)}}{\phi(d)}\frac{d}{x}{log}^B x$$ where C is a fixed constant, $\omega(n)$ is the number of prime factors of $n$, $\mu$ is the Mobius function and D is given by $$D = \sum_{i\lt j}(d_i-d_j)$$ in which $1\leq d_1\lt ... \lt d_r \leq h$, h being a fixed positive constant and the $d_i$'s are integers.

To my understanding the notation $\ll$ means : does not grow faster than, with respect to the variable $x$. The paper can be found here : cambridge.org

What I can't understand is how one gets $$\sum_{\substack{e\gt x/d \\ \text{(e,D)=1}}}\frac{\mu^2(e)*C^{\omega(e)}}{\phi^2(e)}\ll\frac{d}{x}{log}^B x$$