Skip to content

Erdős problem 206

Let x>0x>0 be a real number. For any n≥1n\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.

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:26cb3d58b0213954890f5420691d3893252664a79e280016f298ad998b5aa5c0
Metadata
sha256:1386d6fe506d44d7f548f05af1fbcdf8ff0e2830bf2977eb021019cc9b7a1ea1
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:8e02710f1d59a9d09f079ee08f44a55d67227fa373ea151e8476f071602d28e1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb