Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Girls' Mathematical Olympiad

China counting and probability

Problem

Let be an even number. At the vertices of a regular -gon we write in an arbitrary way distinct real numbers. Starting from one edge, we name all the edges in a clockwise way by . An edge is called "positive", if the difference of the numbers at its endpoint and its start point is positive. A set of two edges is called "crossing", if , and among the four, the numbers written at their vertices, the largest and the third largest ones belong to the same edge. Prove that the number of crossings and the number of positive edges have different parity.
Solution
Without loss of generality, we may assume that the numbers written on the vertices are . Let be the number of crossings, and be the number of positive edges. We will prove that the parity of remains the same if we exchange numbers and . We distinguish two cases.

Case 1. The numbers and are written on adjacent vertices, i.e., the endpoints of edge . Once we exchange and , the number of positive edges is modified by 1, thus the parity of is changed. On the other hand, the only two-edge subset that will become a new crossing (or change from a crossing to a non-crossing) is (the subindices are to be understood modulo ), all the other two-edge subsets will not be affected. So the parity of will change.

Case II. The numbers and are written on non-adjacent vertices. Assume that they are written on the (common) endpoints of , and of , , respectively. Once we exchange and , every positive edge will remain positive, so are non-positive ones. Therefore, is unchanged. Now, for number of crossings, if a two-edge subset does not involve at the same time and , then whether it is a crossing or not is not affected by the operation. So the only two-edge subsets to be considered are the two that have both and written on their vertices and the sum of the edge number is even. They will both become crossing after the exchange if they are not before, and vice-versa. Hence, the parity of remains the same.

Now obviously, every pattern can be obtained from a finite number of such exchange if we start from writing consecutively in a clockwise way, and in the initial situation, . So and have different parity.

---

Alternative solution.

Starting from one vertex, we denote the numbers written on the vertices by in a clockwise way. We may assume that the numbers written on the endpoints of edge are , , where . Apparently is positive if and only if . Now, let be the number of positive edges, and be the number of crossings. Write As is even, the sign of is just .

On the other hand, is a crossing if and only if and We denote by the left-hand side of the above inequality, obviously . This quantity is negative if and only if the two-edge set is a crossing. Now, define then the sign of is . Let us calculate the sign of . For , consider the times of appearance, and the sign of in and , respectively. We distinguish several cases.

Case I. , appears once in with a positive sign, and once in . If , it appears in with a positive sign. If , appears in with a negative sign. The product of these numbers has a negative sign.

Case II. , then does not appear in , and appear in twice. Among and , there is exactly one pair that is of the same parity, among and , there is also exactly one such pair. The sign of in each appearance is always positive. For , its appearance in or comes with a negative sign. Hence, there is a negative sign for each pair (). This part of the product has the sign .

Case III. , then appears once in with a negative sign, and once in (in ) with a positive sign. This part of the product has a negative sign.

In brief, the sign of is negative, i.e., is odd.

Techniques

Invariants / monovariants