Question 1
A rectangle $ABCD$ is drawn on squared paper with its vertices at lattice points and its sides lying along the gridlines. $AD = k \; AB$ with $k$ an integer. Prove that the number of shortest paths from $A$ to $C$ starting out along $AD$ is $k$ times the number starting out along $AB$.