Home » Primes » A conjecture on consecutive primes – II

A conjecture on consecutive primes – II

Blog Stats

  • 13,987 hits
Follow Mathematics: The Language of the universe on WordPress.com

Continuing with the previous post in this topic, a stronger form of conjecture on the lower bound of Corollary 1 is as follows

ConjectureLet p_n be the n-th prime. The for n \ge 32,

\displaystyle{p_n^{\frac{1}{n}} > \Big(1+\frac{1}{n^2}\Big) p_{n+1}^{\frac{1}{n+1}} }.

The above conjecture implies that for all sufficiently large n ,

p_{n+1} - p_n < (\ln p_n - 1)(\ln p_n - \ln\ln n).

Prof. Marek Wolf, Institute of Theoretical Physics, Wroclaw, Poland has verified the above conjecture for primes up to 2^{44}.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: