Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2014_09_16_melfi: Melfi (J. Number Theory 2015) proves that 2^k p q is primitive weird for suitable primes p and q near 2^(k+2), so a prime-gap bound below a tenth of the square root gives infinitely many; refereed, conditional.
Linked from (1)
Graph