Van der Waerden number $W(2,5)$
The smallest number $n$ such that if the integers $1$ to $n$ are colored with $2$ colors, there must be a monochromatic arithmetic progression of length $5$.
Value: $178$
Updates
-
1978-04
Lower bound: $178$
Stevens, R. S., & Shantaram, R. (1978). Computer-generated van der Waerden partitions. Mathematics of Computation, 32(142), 635-636.
[via Van der Waerden number - Wikipedia] -
1978-04
Upper bound: $178$
Stevens, R. S., & Shantaram, R. (1978). Computer-generated van der Waerden partitions. Mathematics of Computation, 32(142), 635-636.
[via Van der Waerden number - Wikipedia]