no of longest path in a rectangle with vertices (0, 0), (0, 2), (n,0), (n, 2)
Source: KJMO 2010 p8
May 3, 2019
combinatoricscombinatorial geometrylattice pathslattice points
Problem Statement
In a rectangle with vertices , ( is a positive integer) find the number of longest paths starting from and arriving at which satis fy the following:
At each movement, you can move right, up, left, down by .
You cannot visit a point you visited before.
You cannot move outside the rectangle.