/

AMC12 2019 B

AMC12 2019 B · Q10

AMC12 2019 B · Q10. It mainly tests Graphs & networks (basic), Logic puzzles.

The figure below is a map showing 12 cities and 17 roads connecting certain pairs of cities. Paula wishes to travel along exactly 13 of those roads, starting at city A and ending at city L, without traveling along any portion of a road more than once. (Paula is allowed to visit a city more than once.) How many different routes can Paula take?
下面的图是一个地图,显示了 12 个城市和连接某些城市对的 17 条道路。Paula 希望从城市 A 开始,沿着恰好 13 条这些道路旅行,到达城市 L,且不重复旅行任何道路的一部分。(Paula 可以多次访问城市。)Paula 可以走多少条不同的路径?
stem
(A) 0 0
(B) 1 1
(C) 2 2
(D) 3 3
(E) 4 4
Answer
Correct choice: (E)
正确答案:(E)
Solution
Answer (E): Label the remaining cities as shown below. Because 3 roads reach cities $B$, $C$, $E$, $H$, $J$, and $K$, at least one of these roads must be excluded from Paula’s route at each of these 6 cities. Furthermore, because the route must begin at $A$ and conclude at $L$, one of the two roads reaching $A$ and one reaching $L$ must be excluded. There are 17 roads and only 4 can be excluded from a 13-road route. Because 8 cities must involve excluded roads and no road can reach more than 2 cities, the 4 excluded roads must each involve 2 of these 8 cities. Because $C$ can be paired only with $B$, and $J$ can be paired only with $K$, $\overline{BC}$ and $\overline{JK}$ must be excluded. For similar reasons, $\overline{AE}$ and $\overline{HL}$ must be the other two excluded roads and Paula’s route must be as shown below. There are exactly 4 routes, depending on the choice of path (clockwise or counterclockwise) around the loops at $F$ and $G$, namely $ABFJIEFGCDHGKL$, $ABFEIJFGHDCGKL$, $ABFJIEFGCDHGKL$, and $ABFEIJFGHDCGKL$.
答案(E):按如下所示标注其余城市。由于有 3 条道路通向城市 $B$、$C$、$E$、$H$、$J$ 和 $K$,因此在这 6 个城市中的每一个,Paula 的路线都必须排除这 3 条道路中的至少一条。此外,由于路线必须从 $A$ 开始并在 $L$ 结束,通向 $A$ 的两条道路中必须排除一条,通向 $L$ 的道路中也必须排除一条。共有 17 条道路,而一条包含 13 条道路的路线只能排除 4 条。由于有 8 个城市必须涉及被排除的道路,且任意一条道路最多连接 2 个城市,所以这 4 条被排除的道路必须各自涉及这 8 个城市中的 2 个。 因为 $C$ 只能与 $B$ 配对,而 $J$ 只能与 $K$ 配对,所以必须排除 $\overline{BC}$ 和 $\overline{JK}$。同理,$\overline{AE}$ 和 $\overline{HL}$ 必须是另外两条被排除的道路,因此 Paula 的路线必须如下面所示。 恰好有 4 条路线,取决于在 $F$ 和 $G$ 处环路选择顺时针或逆时针路径,分别为 $ABFJIEFGCDHGKL$、$ABFEIJFGHDCGKL$、$ABFJIEFGCDHGKL$、以及 $ABFEIJFGHDCGKL$。
solution
Topics
Related Questions
Practice full AMC exams on amcdrill.
Try full-length practice and diagnostics at www.amcdrill.com.