  Given any equation and the integers $[n] = \{1,\dots,n\}$, one can ask: does
every 2-coloring of $[n]$ contain at least as many monochromatic solutions
(asymptotically) as a uniformly random 2-coloring? We show that the answer is
"no" for every 3-term linear equation with integer coefficients, i.e. there
always exist 2-colorings with asymptotically fewer monochromatic solutions than
uniformly random ones.
