Skip to content

Erdős problem 206

Let x>0x>0 be a real number. For any n1n\geq 1 let Rn(x)=i=1n1mi<xR_n(x) = \sum_{i=1}^n\frac{1}{m_i}<x be the maximal sum of nn distinct unit fractions which is <x<x.

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:26cb3d58b0213954890f5420691d3893252664a79e280016f298ad998b5aa5c0
Metadata
sha256:1386d6fe506d44d7f548f05af1fbcdf8ff0e2830bf2977eb021019cc9b7a1ea1
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:8e02710f1d59a9d09f079ee08f44a55d67227fa373ea151e8476f071602d28e1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page