One inequality inspired by Erdos
Abstract
Inspired by the proof of the Bertrand postulate given by P. ErdoS, 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 n2 there is a prime p such that n<p<2n.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.