Skip to content

Erdős problem 645

If ℕ is 22-coloured then there must exist a monochromatic three-term arithmetic progression x,x+d,x+2dx,x+d,x+2d such that d>xd>x.

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. Formal1 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.

Where the source files it734 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.