Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2017-part-04 — 176 problems (EN–VI) Question 161

Math Olympiad Vault · MathNet 2017-part-04 — 176 problems (EN–VI)

Question 161

Determine the smallest positive integer $n$ such that, for any coloring of the elements of the set $\{2, 3, \dots, n\}$ with two colors, the equation $x + y = z$ has a monochrome solution with $x \neq y$. (We say that the equation $x + y = z$ has a monochrome solution if there exist $a, b, c$ distinct, having the same color, such that $a + b = c$.)