2000 character limit reached
On Solving a Curious Inequality of Ramanujan
Published 7 Jul 2014 in math.NT | (1407.1901v1)
Abstract: Ramanujan proved that the inequality $\pi(x)2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$ holds for all sufficiently large values of $x$. Using an explicit estimate for the error in the prime number theorem, we show unconditionally that it holds if $x \geq \exp(9658)$. Furthermore, we solve the inequality completely on the Riemann Hypothesis, and show that $x=38, 358, 837, 682$ is the largest integer counterexample.
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.