Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2008-part-05 — 164 problems (EN–VI) Question 123

Math Olympiad Vault · MathNet 2008-part-05 — 164 problems (EN–VI)

Question 123

Let $n \gt 4$ be a positive integer. Determine the number of ways to walk from $(0,0)$ to $(n, 2)$ using only up and right unit steps such that the path does not meet the lines $y = x$ or $y = x - n + 2$ except at the start and at the end.