# Coloring of positive integers

Suppose $f:\mathbb{Z}^+\longrightarrow X$ is a function, with $X$ a finite set. Is it true that there are $a,b\in\mathbb{Z}^+$ such that $f(a)=f(b)=f(a+b)$.

-

Nice find!${}{}$ –  wj32 Nov 2 '12 at 6:30
Thought I'd include the proof on the site for completeness. Let $$g:\{(i,j)\in\mathbb{Z}^+\times\mathbb{Z}^+:i<j\}\longrightarrow X$$ such that $g(i,j)=f(j-i)$. By Ramsey's Theorem there are $i<j<k$ such that $g(i,j)=g(j,k)=g(i,k)$, i.e. $f(j-i)=f(k-j)=f(k-i)$. The result follows with $a=j-i$ and $b=k-j$.$$~$$ Thanks for finding this. That book looks like it has some nice historical context also. –  gamel Nov 3 '12 at 5:18