MathDB
Problems
Contests
National and Regional Contests
PEN Problems
PEN O Problems
56
O 56
O 56
Source:
May 25, 2007
arithmetic sequence
Problem Statement
Show that it is possible to color the set of integers
M
=
{
1
,
2
,
3
,
⋯
,
1987
}
,
M=\{ 1, 2, 3, \cdots, 1987 \},
M
=
{
1
,
2
,
3
,
⋯
,
1987
}
,
using four colors, so that no arithmetic progression with
10
10
10
terms has all its members the same color.
Back to Problems
View on AoPS