5 Let be a positive integer greater than 1, and there are points on a plane, with no three points being collinear. Among these points, points are colored blue, and the remaining points are colored red. If a line passes through one blue point and one red point, and the number of blue points and red points on each side of the line is the same, then the line is called balanced. Prove: there are at least two balanced lines.
Problem 1075
Official solution
Prove that taking the convex hull of these points, we prove: each vertex on lies on a balanced line.
If the above proposition is proven, then by the condition, has at least 3 distinct vertices, and each balanced line passes through at most two vertices of , so there are at least two balanced lines.
Now we prove (1) holds. For any vertex of , assume is a red point, draw a line through such that is on one side of . Then, rotate counterclockwise around , each time passing through a blue point, to get lines . The number of blue points on the left side of the line is , and the number of red points on this side is denoted as , then .
We need to prove: there exists , such that (thus, (1) holds).
In fact, let , then . Therefore, the sequence starts from a number not less than zero and ends with a number not greater than zero. Furthermore, there is
So, from to , it decreases by at most 1 each time. Therefore, (2) holds.
The proposition is proven.