Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line
parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on
is not greater than
?



To each vertex of a regular pentagon an integer is assigned, so that the sum of all five numbers is positive. If three consecutive vertices are assigned the numbers
respectively, and
, then the following operation is allowed:
are replaced by
respectively. Such an operation is performed repeatedly as long as at least one of the five numbers is negative. Determine whether this procedure necessarily comes to an end after a finite number of steps.



