Part a
Prove the base case: Show that for a \(1 \times 1\) grid, the number of lattice paths from the bottom left to the top right corner is \(\frac{(1+1)!}{1!\,1!} = 2\).
FILTERS
Close