Wiki
Wiki

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

Updated

Claims

../

1959_01_17_schinzel_szekeres: Schinzel and Szekeres (1959): sets of integers up to n with pairwise least common multiples above n have reciprocal sum at most 31/30, yet can leave only o(n) integers divisible by no element; yes and no, refereed, credited.

1996_01_01_chen: Chen (1996): the largest reciprocal sum of a set of integers up to n with pairwise least common multiples above n has limsup at most 1.0170166, so the 31/30 bound holds for all large n; refereed, a partial proof.