Skip to content

Erdős problem 287

Start work

Let k≥2k\geq2. Is it true that, for any distinct integers 1<n1<⋯<nk1 < n_1 < \cdots < n_k such that ∑i=1k1ni=1\sum_{i=1}^k \frac{1}{n_i} = 1, we must have max⁡(ni+1−ni)≥3\max(n_{i+1} - n_i) \geq 3?

Erdős Problems records this as falsifiable.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal5 retained
  4. Resolutionfalsifiable
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it575 share a topic
Number Theory576Unit Fractions48
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources