Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2013_11_27_banks_freiberg_turnage_butterbaugh: Proves that for every m there are infinitely many strings of m plus one consecutive primes whose gaps strictly increase, and infinitely many whose gaps strictly decrease; the case m equal to three is the question; refereed.
Linked from (1)
Graph