# Any progress on the Firoozbakht Conjecture? [closed]

Let $p_n$ be the n-th prime. The Firoozbakht Conjecture is a lesser known conjecture in the theory of primes but it has important consequences. It states that

$$p_n^{\frac{1}{n}} > p_{n+1}^{\frac{1}{n+1}}$$

This truth of this immediately imply the Cramer's conjecture. In fact Firoozbakht conjecture is slightly better than the Cramer's conjecture in the sense that it would imply that

$$p_{n+1} - p_n < \ln^2p_n - \ln p_n.$$

Notice that while Firoozbakht Conjecture will automatically imply the Cramer conjecture, it will also disprove the Cramer-Granville Conjecture.

What has been the progress in this conjecture? Using computer calculation the conjecture has been verified, for all n upto 1.69x$10^{16}.$

-

## closed as no longer relevant by Vladimir Dotsenko, Will Jagy, Yemon Choi, Angelo, Ryan BudneyMar 15 '12 at 18:39

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

I suppose any progress made on a conjecture of such importance would be easily located by google? – John Jiang Mar 6 '12 at 4:29
Why would it disprove the Cramer-Granville conjecture? Gerhard "Ask Me About System Design" Paseman, 2012.03.05 – Gerhard Paseman Mar 6 '12 at 5:31
Given the pointless discussion user 'humble' continues posting more and more comments as new answers, I vote to close as "no longer relevant". – Vladimir Dotsenko Mar 15 '12 at 18:10
I believe the proper reaction is to flag humble’s “answers” as spam, which I just did. – Emil Jeřábek Mar 15 '12 at 18:15
Meta thread: tea.mathoverflow.net/discussion/1326/… – Yemon Choi Mar 15 '12 at 18:33

Significantly rewritten, yet the main message stays the same.

It is quite likely that this conjecture is false yet no counter example was found so far.

The reason why this seems likely is that there seems to be no supporting evidence for this conjecture beyond numerics.

And, there are investigations base on quite natural random models of the primes that contradict it. What is commonly known as Cramér's conjecture, that is that maximal gaps between consecutive primes are of sizes at most $(\log p_n)^2$ (up to lower order terms) does not contradict this conjecture, and one might even think it supports it. However, on the one hand it is not quite clear Cramér even conjectured this in precisely this form; he conjectured gaps are $O((\log p_n)^2)$ and somehow implied that about $(\log p_n)^2$ might be true. On the other hand, and more importantly, Granville note that a finer investigations of Cramér's reasoning rather suggests maximal gaps of size $2 e^{-\gamma} (\log p_n)^2$ (up to lower order terms). And if this were true it would contradict the conjecture mentioned in OP (this is what is referred to in OP as Cramér-Granville conjecture).

It should however be noted that Granville did not conjecture that the gaps are of this size, yet pointed out what taking an additional aspect into account would mean for Cramér's reasoning. For Granville on this matter on MO see Consequences of Legendre's conjecture

For details on Granville's arguments see for example http://www.dartmouth.edu/~chance/chance_news/for_chance_news/Riemann/cramer.pdf

-