Home

Counting routes
Topic Classification: Tags:
Level: Difficulty: Easy
Topics: combinatorics Prerequisites:
Supplies: Pedagogy: warm-up
Problem

If $ A $, $ B $, and $ C $ are cities
If there are 4 roads from $ (A \Longrightarrow B) $ and 3 from
$ B \Longrightarrow C $, how
many ways are there from $ A \Longrightarrow C $? (Assume that
all roads are one-way, in the direction of the arrows.) \par If, in addition, there are 6 roads from $ C\Longrightarrow D $, how many
ways from $ A \Longrightarrow D $? \par As in the problem above, but 4($ A\Longrightarrow B $),
3($ B\Longrightarrow C $), 5($ A\Longrightarrow D $), 5($ D\Longrightarrow<br /> C $). How many ways from $ A \Longrightarrow C $?

Details
Contributer: TRD
Authors
References
Problem Sets This Problem Belongs to:
Set: Set of Easy Problems
VARIABLES


DEFINITIONS