Problem
COM-B1-M11-P009 Routes
#9
★★☆☆☆ Level 2 of 5
How many shortest paths go from \((0,0)\) to \((3,5)\), if only right and up moves are allowed?
There are \(8\) steps total.
Need \(3\) right moves and \(5\) up moves. Choose positions for the \(3\) right moves: \(\binom{8}{3}=56\).
Short task translating a path into a step string.