Prove that there exists an absolute constant $c>0$ such that, whenever $\{1,\dots ,N\}$ is $k$-coloured (and $N$ is large enough depending on $k$) then there are at least $cN$ many integers in $\{1,\dots ,N\}$ which are representable as a monochromatic sum (that is, $a+b$ where $a,b\in \{1,\dots ,N\}$ are in the same colour class and $a\ne b$).