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.

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#206
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page