Schur number $S(9)$
The largest number $n$ such that the integers $1$ to $n$ can be colored with $9$ colors with no monochromatic solution to $x + y = z$.
Lower bound:
$17803$
(17,803)
Upper bound:
Unknown
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
- Lower bound: None yet
- Upper bound: None yet
Updates from the literature
-
2021-12-06
Lower bound: $17803$
(17,803)
R. Ageron, P. Casteras, T. Pellerin, Y. Portella, A. Rimmel and J. Tomasik, New lower bounds for Schur and weak Schur numbers, arXiv:2112.03175.