Checking the Firoozbakht conjecture up to 1000000

Doing Math with JavaScript | Firoozbakht conjecture

The Firoozbakht conjecture:
Let pk be the k-th prime, then the sequence (pk)1/k is strictly decreasing.
Alternative formulation(pk)k+1 > (pk+1)k, where pk is the k-th prime.

Here is a check of the Firoozbakht conjecture for pk < 1000000:

      k       p        p1/k       OK/fail  Alternative formulation:

Copyright © 2011-2015, Alexei Kourbatov,