Skip to content

Erdős problem 285

Start work

Let f(k)f(k) be the minimal value of nkn_k such that there exist n1<n2<⋯<nkn_1 < n_2 < \dots < n_k with 1=1n1+⋯+1nk. 1 = \frac{1}{n_1} + \cdots + \frac{1}{n_k}. Is it true that f(k)=(1+o(1))ee−1k? f(k) = (1 + o(1)) \frac{e}{e - 1} k ?

Erdős Problems records this as proved.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. Resolutionproved
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it575 share a topic
Number Theory576Unit Fractions48
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources