Problem
COM-B1-M10-P009 Path \((0,0)\to(4,3)\)
#9
★★☆☆☆ Level 2 of 5
How many shortest paths go from \((0,0)\) to \((4,3)\)?
Need \(4\) right moves and \(3\) up moves.
There are \(7\) steps total. Choose positions for the \(4\) right moves: \(\binom{7}{4}=35\).
Basic lattice-path problem.