|
|
| (3 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | ==Problem==
| + | #REDIRECT [[2020 AMC 10B Problems/Problem 17]] |
| − | | |
| − | There are <math>10</math> people standing equally spaced around a circle. Each person knows exactly <math>3</math> of the other <math>9</math> people: the <math>2</math> people standing next to her or him,as well as the person directly across the circle. How many ways are there for the <math>10</math> people to split up into <math>5</math> pairs so that the members of each pair know each other?
| |
| − | | |
| − | <math>\textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 15</math>
| |
| − | | |
| − | ==Solution==
| |
| − | We have 2 cases. Assume these people are A,B,...,J.
| |
| − | Case 1: Group with people nearby: we have (AB)(CD)(EF)(GH)(IJ) and (AJ)(IH)(GF)(ED)(CB), totally 2 cases.
| |
| − | Case 2: (AF) is a group. So here we have 3 sub-cases:
| |
| − | Sub 1: The rest of them group with people nearby, that is (BC)(DE)(GH)(IJ), we have 5 cases since (AF) can be (BG), (CH), (DI) and (EJ).
| |
| − | Sub 2: (BG)(CH) are groups, the rest groups are (DE)(IJ). We also have 5 cases for the same reason of Sub 1.
| |
| − | Sub 3: (AF)(BG)(CH)(DI)(EJ), 1 case.
| |
| − | Thus, the total number of cases are 2+5+5+1=13 cases. So put <math>\boxed{C}</math>.
| |
| − | | |
| − | ~FANYUCHEN20020715
| |
| − | | |
| − | ==See Also==
| |
| − | | |
| − | {{AMC12 box|year=2020|ab=B|num-b=14|num-a=16}}
| |
| − | {{MAA Notice}}
| |
