Question 122
Let $n \gt 2$ be a positive integer. Prove that there are $\frac{1}{2}(n-2)(n+1)$ ways to walk from $(0,0)$ to $(n, 2)$ using only up and right unit steps such that the walk never visits the line $y=x$ after it leaves the origin.
Math Olympiad Vault · MathNet 2008-part-05 — 164 problems (EN–VI)