Remarks on Ramanujan's inequality concerning the prime counting function (Q2667563)

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.