# Firoozbakht's conjecture

In number theory, Firoozbakht’s conjecture (or the Firoozbakht conjecture) is a conjecture about the distribution of prime numbers. It is named after the Iranian mathematician Farideh Firoozbakht from the University of Isfahan who stated it first in 1982.

The conjecture states that $p_{n}^{1/n}$ (where $p_{n}$ is the nth prime) is a strictly decreasing function of n, i.e.,

${\sqrt[{n+1}]{p_{n+1}}}<{\sqrt[{n}]{p_{n}}}\qquad {\text{ for all }}n\geq 1.$ Equivalently:

$p_{n+1} see , .

By using a table of maximal gaps, Farideh Firoozbakht verified her conjecture up to 4.444×1012. Now with more extensive tables of maximal gaps, the conjecture has been verified for all primes below 2641.84×1019.

If the conjecture were true, then the prime gap function $g_{n}=p_{n+1}-p_{n}$ would satisfy:

$g_{n}<(\log p_{n})^{2}-\log p_{n}\qquad {\text{ for all }}n>4.$ Moreover:

$g_{n}<(\log p_{n})^{2}-\log p_{n}-1\qquad {\text{ for all }}n>9,$ see also . This is among the strongest upper bounds conjectured for prime gaps, even somewhat stronger than the Cramér and Shanks conjectures. It implies a strong form of Cramér's conjecture and is hence inconsistent with the heuristics of Granville and Pintz and of Maier which suggest that

$g_{n}>{\frac {2-\varepsilon }{e^{\gamma }}}(\log p_{n})^{2}\approx 1.1229(\log p_{n})^{2},$ occurs infinitely often for any $\varepsilon >0,$ where $\gamma$ denotes the Euler–Mascheroni constant.

Two related conjectures (see the comments of ) are

$\left({\frac {\log(p_{n+1})}{\log(p_{n})}}\right)^{n} which is weaker, and

$\left({\frac {p_{n+1}}{p_{n}}}\right)^{n}5,$ which is stronger.