Problem
COM-B1-M01-P007 Short Paths
#7
★★☆☆☆ Level 2 of 5
How many shortest paths go from the lower-left corner of a \(3\) by \(2\) grid to the upper-right corner if one may only move right and up?
Each path consists of \(3\) right steps and \(2\) up steps.
We must place \(2\) up steps among \(5\) total steps. This can be done in \(10\) ways: choose the two positions of the up steps among five.
Can be presented without binomial notation, via positions.