On $|{\rm Li}(x)-\pi(x)|$ and primes in short intervals
Shan-Guang Tan

TL;DR
This paper proves bounds on the difference between the logarithmic integral and the prime counting function, and establishes a precise asymptotic for the number of primes in short intervals using improved error estimates.
Contribution
It introduces new bounds on |Li(x)-π(x)| and derives an accurate asymptotic formula for primes in short intervals based on refined error estimates.
Findings
|Li(x)-π(x)| ≤ c√x log x for x ≥ 10^3
Asymptotic formula for primes in short intervals with error less than x^{1/2-0.0327}
Limit of prime count ratio in short intervals approaches 1 as x→∞
Abstract
Two topics of the number theory are discussed in this paper. First, we prove that given each natural number , we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where is a constant greater than and less than . Second, with a much more accurate estimation of prime numbers, the error range of which is less than for , we prove a theorem of the number of primes in short intervals: Given a positive real number that determines a real number by , let for where when let . Then there are \[ \frac{\pi(x+\Phi(x))-\pi(x)}{\Phi(x)/\log x}=1+O(\frac{1}{\log x}) \] and \[ \lim_{x \to \infty}\frac{\pi(x+\Phi(x))-\pi(x)}{\Phi(x)/\log x}=1. \]
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
