2000 character limit reached
Estimates for $π(x)$ for large values of $x$ and Ramanujan's prime counting inequality
Published 7 Mar 2017 in math.NT | (1703.02407v2)
Abstract: In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $\pi(x)$, which improve the current best estimates for large values of $x$. As an application we find an upper bound for the number $H_0$ which is defined to be the smallest positive integer so that Ramanujan's prime counting inequality holds for every $x \geq H_0$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.