2000 character limit reached
On Ramanujan's prime counting inequality
Published 6 Jul 2022 in math.NT | (2207.02486v2)
Abstract: In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $\pi(x)$ holds for every $x \geq N_{\mathcal{R}}$.
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.