Skip to content

Erdős problem 46

Start work

Does every finite colouring of the integers have a monochromatic solution to 1=∑1ni1=\sum \frac{1}{n_i} with 2≤n1<⋯<nk2\leq n_1<\cdots <n_k?

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal3 retained
  4. Resolutionproved (Lean)
  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 it674 share a topic
Number Theory576Ramsey Theory114Unit Fractions48
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources