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>, <...") |
|||
Line 22: | Line 22: | ||
<math>\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 18</math> | <math>\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 18</math> | ||
+ | |||
+ | ==Solution== | ||
+ | |||
+ | == See also == | ||
+ | {{AMC12 box|year=2013|ab=B|num-b=11|num-a=13}} |
Revision as of 17:06, 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.)
Solution
See also
2013 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 11 |
Followed by Problem 13 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |