Difference between revisions of "2013 AMC 12B Problems/Problem 12"
(Created page with "==Problem== Cities <math>A</math>, <math>B</math>, <math>C</math>, <math>D</math>, and <math>E</math> are connected by roads <math>AB</math>, <math>AD</math>, <math>AE</math>, <...") |
(No difference)
|
Revision as of 15:56, 22 February 2013
Problem
Cities , , , , and are connected by roads , , , , , , and . How many different routes are there from to that use each road exactly once? (Such a route will necessarily visit some cities more than once.)