The generalization and proof of Bertrand's postulate (Q579293)

To every \(\epsilon >0\), the interval [x, x\(+\epsilon x]\) always contains a prime, provided that \(x\geq x_ 0(\epsilon)\). This is a simple consequence of the prime number theorem. Moreover \(x_ 0(\epsilon)\) can be determined explicitly in terms of \(\epsilon\) from any effective estimate of the error term associated with the asymptotic formula for \(\pi\) (x) or \(\theta\) (x). Using an effective estimate for \(\theta\) (x) the author gives a clumsy proof of his Theorem 1 which is an unnecessarily complicated restatement of the above. His second theorem states that if \(x-cx^{\rho}<\theta (x)<x+c'x^{\rho}\) where \(\rho,c,c'>0\) then the interval \([x-(c+c')x^{\rho}, x]\) contains a prime. But this is too trivial to be an exercise even for beginners.