Remarks on Ramanujan's inequality concerning the prime counting function
If \(\pi(x)\) denotes the prime counting function, one of the many results by Ramanujan (to be found on p. 310 of his second notebook) states that \[\pi(x)^2<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right).\] This paper focuses on two aspects: First, the sharpness of this inequality. Second, its ``structure. For the first aspect, the author proves, among other results, that for some negative numbers \(d_k\) that are perfectly defined: \[\pi(x)^2<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right)+x^2\sum_{k=4}^{m}\frac{d_k}{\log^{k+2}x}.\] As for the second aspect, the author provides some analogs or generalizations to the original result. For example, it is proved that the original inequality still holds (for sufficiently large values of \(x\)) if we replace \(e\) by any value \(\alpha\geq e\), while if \(0<\alpha<e\) the inequality reverses.
- On an inequality of Ramanujan concerning the prime counting function
- A remark on an inequality for the prime counting function
- On Ramanujan's prime counting inequality
- Generalizations of an inequality of Ramanujan concerning prime counting
- A remark on a sum involving the prime counting function
- On Landau's inequality for the prime counting function
- On the estimates of the upper and lower bounds of Ramanujan primes
- scientific article; zbMATH DE number 7633011
- On a conjecture on Ramanujan primes
- Estimates for \(\pi(x)\) for large values of \(x\) and Ramanujan's prime counting inequality
- Estimates of the \(k\)th prime under the Riemann hypothesis
- Generalizations of an inequality of Ramanujan concerning prime counting
- scientific article; zbMATH DE number 492966 (Why is no real title available?)
- scientific article; zbMATH DE number 3224518 (Why is no real title available?)
- NIST handbook of mathematical functions
- Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function
- On an inequality of Ramanujan concerning the prime counting function
- On solving a curious inequality of Ramanujan
- The error term in the prime number theorem
- Updating the error term in the prime number theorem
- Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
- On solving a curious inequality of Ramanujan
- On Ramanujan's Inequalities for exp( k )
- A generalization of the Hardy-Littlewood conjecture
- Estimates for \(\pi(x)\) for large values of \(x\) and Ramanujan's prime counting inequality
- Generalizations of an inequality of Ramanujan concerning prime counting
- A Formula of Ramanujan in the Theory of Primes
- Discretization of prime counting functions, convexity and the Riemann hypothesis
- On Ramanujan's prime counting inequality
- Inequalities involving arithmetic functions
- On an inequality of Ramanujan concerning the prime counting function
This page was built for publication: Remarks on Ramanujan's inequality concerning the prime counting function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667563)
