Let n be a fixed positive odd integer. Take m+2 distinct points P0,P1,…,Pm+1 (where m 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), and for each integer i,1≤i≤m, both x- and y- coordinates of Pi are integers lying in between 1 and n (1 and n inclusive).
2) For each integer i,0≤i≤m, PiPi+1 is parallel to the x-axis if i is even, and is parallel to the y-axis if i is odd.
3) For each pair i,j with 0≤i<j≤m, line segments PiPi+1 and PjPj+1 share at most 1 point.
Determine the maximum possible value that m can take. analytic geometryinductioncombinatorics proposedcombinatorics