Erdős Problem #304 — Egyptian fraction lengths with distinct denominators
For integers and , let be the least positive integer for which there are integers satisfying and
Define
where the maximum is over integer . The question is to estimate as grows, in particular whether there are absolute constants and such that
for every integer . Erdős Problems #304
Background
These representations are Egyptian fractions: sums of distinct unit fractions. The practice is ancient; the Rhind Papyrus, dating to around 1650 B.C., includes examples of such decompositions. Erdős’s 1950 paper made the maximal length needed to represent a rational with fixed denominator into a quantitative problem and proposed the order of growth asked about here. Graham, Paul Erdős and Egyptian Fractions
The question is listed as Erdős–Graham, 1980, p. 37. Its close connection with the separate problem of finding unit-fraction decompositions of with prescribed denominator features is also noted in later work on that topic; in particular, the boundary case is singled out. Erdős Problems #304 The smallest denominator not contained in a unit fraction decomposition of 1 with fixed length
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.