# 2021-09 Monochromatic solution of an equation

For given $$k\in \mathbb{N}$$, determine the minimum natural number $$n$$ satisfying the following: no matter how one colors each number in $$\{1,2,\dots, n\}$$ red or blue, there always exists (not necessarily distinct) numbers $$x_0, x_1,\dots, x_k \in [n]$$ with the same color satisfying $$x_1+\dots + x_k = x_0$$.

GD Star Rating