Erdős problem 138
If is the least such that every two-colouring of contains a monochromatic -term arithmetic progression, must ?
Sources
FormalConjectures/ErdosProblems/
138.lean
Retained formal statement
Erdos138.W 1 = 1Erdős problem 138
The source's own material, retained exactly.
10 retained statements · 36c6d0fef71a
Open selected sourceFormalConjectures/ErdosProblems/
138.lean
1Erdos138.W 1 = 1The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.