Combinatorics Harvard-MIT
2018


Problem - 4494

How many ways are there for Nick to travel from $(0,\ 0)$ to $(16,\ 16)$ in the coordinate plane by moving one unit in the positive $x$ or $y$ direction at a time, such that Nick changes direction an odd number of times?


report an error