MathDB
Maximum for m when 3 conditions are satisfied

Source: APMO 2011

May 18, 2011
analytic geometryinductioncombinatorics proposedcombinatorics

Problem Statement

Let nn be a fixed positive odd integer. Take m+2m+2 distinct points P0,P1,,Pm+1P_0,P_1,\ldots ,P_{m+1} (where mm is a non-negative integer) on the coordinate plane in such a way that the following three conditions are satisfied: 1) P0=(0,1),Pm+1=(n+1,n)P_0=(0,1),P_{m+1}=(n+1,n), and for each integer i,1imi,1\le i\le m, both xx- and yy- coordinates of PiP_i are integers lying in between 11 and nn (11 and nn inclusive). 2) For each integer i,0imi,0\le i\le m, PiPi+1P_iP_{i+1} is parallel to the xx-axis if ii is even, and is parallel to the yy-axis if ii is odd. 3) For each pair i,ji,j with 0i<jm0\le i<j\le m, line segments PiPi+1P_iP_{i+1} and PjPj+1P_jP_{j+1} share at most 11 point. Determine the maximum possible value that mm can take.