Skip to content

Erdős Problem #148

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, unit fractions.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

How many ways can one express the number one as the sum of exactly \(k\) distinct unit fractions? Let \(F(k)\) count solutions of

\[ 1=\frac1{n_1}+\cdots+\frac1{n_k}, \qquad 1\le n_1<\cdots<n_k, \]

where the denominators are positive integers. The strict ordering prevents counting permutations of the same representation multiple times and prohibits repeated denominators.

Erdős and Graham asked for good upper and lower estimates on \(F(k)\) as \(k\) becomes large. This is a counting problem, not merely an existence question.

A small example

For \(k=1\), the unique representation is \(1=1/1\), so \(F(1)=1\). For \(k=2\) there is no representation with distinct positive denominators: if the first denominator is at least two, the sum of two strictly decreasing unit fractions is below one, and if it is one, any second term overshoots. Hence \(F(2)=0\).

For \(k=3\), the representation

\[ 1=\frac12+\frac13+\frac16 \]

is valid. Exact enumeration establishes \(F(3)=1\); one should not substitute unrestricted Egyptian fractions in which denominator repetition is allowed.

What is known

The sharp growth of \(F(k)\) remains OPEN. The maintained Erdős #148 records the double-exponential-type bounds

\[ 2^{c^{\,k/\log k}}\le F(k) \le c_0^{(1/5+o(1))2^k}, \]

where \(c>1\) is an absolute constant (with a base adjustment absorbed into the notation) and \(c_0\approx1.26408\) is the Vardi constant. The lower bound is attributed to S. V. Konyagin, Double exponential lower bound for the number of representations of unity by Egyptian fractions, Mathematical Notes 95 (2014), 277–281. The upper bound is attributed to Christian Elsholtz and Stefan Planitzer (2021).

OEIS A006585 independently records the small values \(F(1),\ldots,F(8)\) as \(1,0,1,6,72,2320,245765,151182379\). Its values are useful finite checks, not independent certification of the large-parameter analytic estimates. The strict-ordering condition is material: counting ordered tuples multiplies solutions by \(k!\), while permitting repeated denominators changes the count in another way.

GCL's current state

Both the pinned and maintained catalogues classify #148 OPEN. Original source issue: #1417. Historical growth bounds were checked against the catalogue and OEIS bibliography; the complete original 2014 and 2021 proofs have not been independently reconstructed.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded exact-rational search enumerates all strict \(k\) term Egyptian fraction representations of one for \(k=1,2,3,4\). Acceptance: \(F(1)=1\), \(F(2)=0\), \(F(3)=1\), \(F(4)=6\), no duplicates from permutations, and every rational sum checked using integer cross multiplication. A terminating search needs mathematically justified denominator bounds, not an arbitrary cutoff. This finite fixture cannot establish double-exponential asymptotics.

Sources and claim boundaries

No new counting estimate, independent source-proof certification or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1417 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: FORMAL_SOURCE_REFRESH_REQUIRED.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction