Problem

Source: II International Festival of Young Mathematicians Sozopol 2011, Theme for 10-12 grade

Tags: number theory, Coloring



Let $\sum_{i=1}^n a_i x_i =0$, $a_i\in \mathbb{Z}$. It is known that however we color $\mathbb{N}$ with finite number of colors, then the upper equation has a solution $x_1,x_2,...,x_n$ in one color. Prove that there is some non-empty sum of its coefficients equal to 0.