Lesson 5: Arrangements with repeated objects

Shortest routes through a street grid

SkillArrangements with repeated objects

Worked example

  • Complex familiar
  • Technology free

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?

1 of 4 steps
  1. 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.

Try a similar one

A fresh question of the same kind, checked as you answer, with hints and a full solution.

Method

  1. Write a route as a string of E and N moves.

  2. Count the arrangements of that string.

  3. For a route through a point, multiply the counts for the two stages.

Watch out for

  • Adding the two stages, 3+103 + 10, instead of multiplying.

  • Using 8!8! without dividing by 5! 3!5!\,3!: all the E moves are alike, and so are the N moves.

Save your progress with a free account