Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

2010_01_01_epure_gica: Epure and Gica show, with a class-number-one result of Mollin and Williams, that at most nine integers n have n - 2x^2 prime for every x with 2x^2 < n, so the answer to the question is no.