We know Bertrand's Postulate, but what about its extensions?For n<p<kn for a real number k, what is the smallest possible k such that the above statement still holds?Now how about if we do it like x<n<p<kn for any integer x? Can we prove definitively that as x increases whatever value k is must strictly decrease? And do we know what limit k approaches if it does strictly decreases? We know that k != 1 because a n simply cannot be such that n>n. So we know k>1 forever, but does k approach 1 as x increases?
>>16779653>real numbers r such that there is always a prime n<p<rnGood question idk>what’s the lim inf as n gets bigI also dk LOL
>>16779653
