Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_02_13_koukoulopoulos_lamzouri_lichtman: A set of reals above one whose elements keep distance at least one from every integer multiple of the others has reciprocal sum o(log n) up to n, the second of the problem's two displayed assertions.
2026_10_02_apicella: A countable set of rationals above two, each at distance at least one from every integer multiple of the others, whose sum of 1/(a log a) diverges; posted as a forum proof claim with a Lean project, prepared with GPT 6 Astra.
Linked from (1)
Graph