Skip to content

Erdős problem 285

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 ?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:fd3de54d57257f16e5ce88ed5f3cf65d4303422fb9773dd15524acfa578122a2
Metadata
sha256:ba24b844babdffa9e980a5d0b4c0a315767856d24444818b7aa911457a20f96f
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:183993d8ea24e60cdfb64ac906ab4beaf0df27b800abd38db905b898efe8a607
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb