Problem
COM-B1-M12-P005 Set 2. Path
#5
★☆☆☆☆ Level 1 of 5
How many shortest paths go from \((0,0)\) to \((3,2)\), if only right and up moves are allowed?
There are \(5\) steps total.
Need \(3\) right moves and \(2\) up moves. Choose positions for the \(2\) up moves: \(\binom{5}{2}=10\).
Transition from geometry to a step string.