2018 AMC 10B Problems/Problem 18
Three young brother-sister pairs from different families need tot take a trip in a van. These six children will occupy the second and third rows in the van, each of which has three seats. To avoid disruptions, siblings may not sit right next to each other in the same row, and no child may sit directly in front of his or her sibling. How many seating arrangements are possible for this trip?
Solution (Casework)
We can begin to put this into cases. Let's call the pairs , and , and assume that a member of pair is sitting in the leftmost seat of the second row. We can have the following cases then.
Case 1: Second Row: a b c Third Row: b c a
Case 2: Second Row: a c b Third Row: c b a
Case 3: Second Row: a b c Third Row: c a b
Case 4: Second Row: a c b Third Row: b a c
For each of the four cases, we can flip the siblings, as they are distinct. So, each of the cases has possibilities. Since there are four cases, when pair has someone in the leftmost seat of the second row, there are 32 ways to rearrange it. However, someone from either pair , , or could be sitting in the leftmost seat of the second row. So, we have to multiply it by 3 to get our answer of . So, the correct answer is .
Written By: Archimedes15
Solution
Call the siblings , , , , , and .
There are 6 choices for the child in the first seat, and it doesn't matter which one takes it, so suppose Without loss of generality that takes it (a is an empty seat):
Then there are 4 choices for the second seat (, , , or ). Again, it doesn't matter who takes the seat, so WLOG suppose it is :
The last seat in the first row cannot be because it would be impossible to create a second row that satisfies the conditions. Therefore, it must be or . Suppose WLOG that it is . There are two ways to create a second row:
Therefore, there are possible seating arrangements.
Written by: R1ceming
Solution (Using the Answers)
Notice how given an arrangement of the children that works (the answers tell us there is at least one) we can swap each pair of the siblings in one of 2 ways for = 8 arrangements, and each of the 3 pairs can take each others' spaces in 3! = 6 ways. This means that the answer must be divisible by 48.
See Also
2018 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 17 |
Followed by Problem 19 | |
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 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.