arXiv · 2503.03469
One inequality inspired by Erdős
Abstract
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\ge2$ there is a prime $p$ such that $n<p<2n$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Barbora Batíková, Tomáš J. Kepka, Petr C. Němec. 2025-03-05. One inequality inspired by Erdős. https://arxiv.org/abs/2503.03469
Cite the original work for its findings. Save a collection to share your selection of sources.