Lesson 5: Arrangements with repeated objects
Shortest routes through a street grid
SkillArrangements with repeated objects
Worked example
A courier drives from the depot A to a customer at B along the streets of the grid shown, always heading east or north.
(a) How many different shortest routes are there?
(b) How many of these pass through the intersection P?
Step 1: Describe a route as a string of moves
Every shortest route is 5 moves east (E) and 3 moves north (N) in some order, such as EENENEEN.
Any move west or south would make the route longer.
Step 2: Count the arrangements of EEEEENNN
Step 3: Split the route at P
A to P is 2 east and 1 north: routes. P to B is 3 east and 2 north: routes.
Step 4: Multiply
Each route to P can be followed by each route from P: .
The journey is two stages, so the multiplication principle applies.
Answer
(a) 56 (b) 30
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Write a route as a string of E and N moves.
Count the arrangements of that string.
For a route through a point, multiply the counts for the two stages.
Watch out for
Adding the two stages, , instead of multiplying.
Using without dividing by : all the E moves are alike, and so are the N moves.