One inequality inspired by Erdős

Inspired by the proof of the Bertrand postulate given by P. ErdőS, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer $n\ge 2$ there is a prime $p$ such that $n<p<2n$.