Checking the Firoozbakht conjecture up to 1000000
Doing Math with JavaScript
 Firoozbakht conjecture
The Firoozbakht conjecture:
Let p_{k} be the kth prime, then the sequence
(p_{k})^{1/k} is strictly decreasing.
Alternative formulation:
(p_{k})^{k+1} > (p_{k+1})^{k},
where p_{k} is the kth prime.
Here is a check of the
Firoozbakht conjecture
for p_{k} < 1000000:
k p p^{1/k} OK/fail Alternative formulation:
