Claims

../

2021_12_07_bloom: Bloom's theorem that a subset of the first N integers with reciprocal sum at least a constant times log N log log log N over log log N has a subset with reciprocal sum one; the threshold is below delta log N for large N.

2024_04_10_liu_sawhney: Liu and Sawhney's theorem that a subset of the first N integers with reciprocal sum at least (log N)^(4/5+epsilon) has a subset with reciprocal sum one; the threshold is far below delta log N for large N.

---