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))ee1k? f(k) = (1 + o(1)) \frac{e}{e - 1} k ?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:183993d8ea24e60cdfb64ac906ab4beaf0df27b800abd38db905b898efe8a607
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page