加载中…
Ramanujan proved that the inequality $\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)x$. Using an explicit estimate for the error in the prime number theorem, we show unconditionally that it holds if . Furthermore, we solve the inequality completely on the Riemann Hypothesis, and show that $x=38, 358, 837, 682$ is the largest integer counterexample.

生成讲解博客的中文版本

生成AI智能校验的中文版本