Abstract

We show that, for any fixed ε > 0, there are asymptotically the same number of integers up to x , that are composed only of primes ⩽ y, in each arithmetic progression (mod q ), provided that y ⩾ q 1+e and log x /log q →∞ as y →∞: this improves on previous estimates.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call