Abstract
In this paper it is shown that, as q runs through the odd primes in an arithmetic progression, the sum ∑ n−1 ∞ n q 1 q has considerable variation in size. The proof uses the uniform prime-number theorem and a recent version of the large sieve.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
