Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
With the least number of distinct unit fractions with sum and largest term at most (p. 302), the solution of Erdős and Straus ends on p. 303 with the unnumbered remark: "It seems to us certain that as but we have not proved this."
The editorial note after the solution (p. 303) adds a second, separate conjecture, credited to no one by name: "Several solvers conjecture that is an upper bound for ." The note lists the other solvers who found bounds (Bohigian, Gardner, Kelly, Lossers, Reich, Schmeichel and the proposer) without saying which of them made this conjecture. Inequality (1) gives for all sufficiently large , since ; this is drawn here, not in the print, and leaves the small unchecked.
Source. H. D. Ruderman (proposer), P. Erdős and E. Straus (solvers), E2232, Representation of 1 by Egyptian fractions, Amer. Math. Monthly 78 (1971), no. 3, 302--303, doi:10.2307/2317539; the remark and the editorial note on p. 303. Edition and provenance are on the source card.
Read depth. Claims checked: both sentences were read on the page image of p. 303. They are conjectures; there is no proof.
Proof pointer
None. The solution proves only the two-sided bound (1), whose lower half shows that is bounded below.
Dependencies
None (a conjecture).
Bears on
- Problem 295: the first remark states, as a belief, the divergence that the problem asks about; the second conjecture is not the problem's question.