Two questions came to mind when I was reading the proof for Bertrand's Postulate (there's always a prime between n and 2n): (1) Can we change the proof somehow to show that: AAx>x_0, there exists a prime p in [x,ax], for some a in (1,2)? (2) Suppose the (1) is true, what is the smallest value of x_0?

schnelltcr

schnelltcr

Open question

2022-08-16

Two questions came to mind when I was reading the proof for Bertrand's Postulate (there's always a prime between n and 2 n):
(1) Can we change the proof somehow to show that: x > x 0 , there exists a prime p [ x , a x ], for some a ( 1 , 2 )?
(2) Suppose the (1) is true, what is the smallest value of x 0 ?
I'm not sure how to prove either of them, any input would be greatly appreciated! And correct me if any of the above statement is wrong. Thank you!

Answer & Explanation

Riya Cline

Riya Cline

Beginner2022-08-17Added 17 answers

There are better results than Bertrand's Postulate. Pierre Dusart has proven better results.
Less specifically, for any k > 1, k R , one can show that lim n π ( k n ) π ( n ) n / ln n = k 1 using the prime number theorem, which means that for any k > 1, there is some x 0 such that for x > x 0 , there is a prime between x and k x.

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Elementary geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?