Bertrand's Postulate

masser · 2003-07-30, 02:08

Bertrand's Postulate (aka Chebyshev's Thm) states that for n>2, there exists a prime p such that

n < p < 2n.

Has there been any work on finding prime numbers between a large known prime, say p_i, and its double, 2p_i ? Does anyone know how one might try to find such a prime? Just curious.

hyh1048576 · 2003-07-30, 03:07

[p,2p] is too large a range. :?
Of course there are primes,but it's too difficult to found(or do primary test) ;)

2003-07-30, 02:08	#1
masser Jul 2003 wear a mask 1,657 Posts	Bertrand's Postulate Bertrand's Postulate (aka Chebyshev's Thm) states that for n>2, there exists a prime p such that n < p < 2n. Has there been any work on finding prime numbers between a large known prime, say p_i, and its double, 2p_i ? Does anyone know how one might try to find such a prime? Just curious.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Bertrand's Theorem for Arithmetic Progression	literka	Math	0	2013-06-01 12:42

2003-07-30, 03:07	#2
hyh1048576 Jun 2003 2⁶ Posts	[p,2p] is too large a range. :? Of course there are primes,but it's too difficult to found(or do primary test) ;)