Grinstead-Snell-Probability · Problem 3.1.5

Combinatorics

Mathematics · permutations

Problem

There are three different routes connecting city A to city B. How many ways can a round trip be made from A to B and back? How many ways if it is desired to take a different route on the way back?

Related theory

Browse the problem library