MathDB
2013 Japan Mathematical Olympiad Finals Problem 5

Source:

February 13, 2013
inductioncombinatorics proposedcombinatorics

Problem Statement

Let nn be a positive integer. Given are points P1, P2, , P4nP_1,\ P_2,\ \cdots,\ P_{4n} of which any three points are not collinear. For i=1, 2, , 4ni=1,\ 2,\ \cdots,\ 4n, rotating half-line PiPi1P_iP_{i-1} clockwise in 9090^\circ about the pivot PiP_i gives half-line PiPi+1.P_iP_{i+1}. Find the maximum value of the number of the pairs of (i, j)(i,\ j) such that line segments PiPi+1P_iP_{i+1} and PjPj+1P_jP_{j+1} intersect at except endpoints. Note that : P0=P4n, P4n+1=P1P_0=P_{4n},\ P_{4n+1}=P_1 and 1i<j4n.1\leq i<j\leq 4n.