On a conjecture of R. M. Murty and V. K. Murty II
Yuchen Ding, Victor Zhenyu Guo, Yu Zhang

TL;DR
This paper proves a conjecture related to the sum of a function counting primes with specific divisibility properties, assuming a major unproven hypothesis, and introduces a novel sieve method for the proof.
Contribution
It confirms a conjecture by Murty and Murty on the asymptotic behavior of a prime-related sum under the Elliott--Halberstam conjecture, using a new sieve approach.
Findings
Confirmed the conjecture assuming Elliott--Halberstam conjecture
Developed a sieve method for prime sums in arithmetic progressions
Provided asymptotic formula for the sum involving sterisk(n)
Abstract
Let be the number of primes such that divides . Assuming the Elliott--Halberstam Conjecture, we prove a conjecture posted by M. R. Murty and V. K. Murty in 2021 which states that The above sum was first investigated by Prachar in 1955. One of the key ingredients in our argument is the application of a sieve result on estimating various certain summations involving primes in arithmetic progressions, rather than a direct use of the Brun--Titchmarsh inequality which would not be applicable for our task.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · History and Theory of Mathematics · Limits and Structures in Graph Theory
