Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. The answer to Problem 310 is yes: for every fixed density there is a bound such that every with contains a subset whose reciprocal sum is a rational with . Liu and Sawhney prove the quantitative form recorded on the result page Proposition 1.4 of their paper On further questions regarding unit fractions: there is an absolute constant such that for every , every large in terms of , and every with and , some has with . For fixed this is the statement with , and ; for fixed the case applies to any subset of of size at least , a one-line reduction recorded on the problem page. The paper remarks (p. 3) that a direct application of Bloom's Proposition 1 with standard estimates already gives , which is the qualitative answer the site attributes to Bloom's density theorem through this observation, while the range of and the bound need the paper's own methods; the dependence on is sharp up to the constant, since the integers in with all prime factors above have density , reciprocal sum below , and no nontrivial subsum with denominator below .
Acceptance. Refereed: the paper is published in International Mathematics Research Notices 2026, no. 2, rnaf382 (published online 14 January 2026; DOI 10.1093/imrn/rnaf382). Reviewed: the site's curator, T. F. Bloom, marks the problem proved and credits the answer to Liu and Sawhney's observation and their precise version; Bloom is not an author of their paper (Bloom's density theorem is the input their remark applies), so the credit is independent of the claimants. arXiv v1 (10 April 2024) is the only arXiv version, and its result page records the proof (p. 21) as a pointer and sketch with four parameter questions to be compared against the published text; the corpus has not verified the proof, and the acceptance rests on the refereed publication and the curator's credit.