Difference between revisions of "2018 AMC 10B Problems/Problem 18"
Ericshi1685 (talk | contribs) (→Solution 4 (a bit of group theory)) |
Ericshi1685 (talk | contribs) (→Solution 5) |
||
Line 72: | Line 72: | ||
<math>A B C</math> | <math>A B C</math> | ||
+ | |||
<math>B C A</math> | <math>B C A</math> | ||
Line 77: | Line 78: | ||
<math>C B A</math> | <math>C B A</math> | ||
+ | |||
<math>A C B</math> | <math>A C B</math> | ||
Revision as of 16:18, 27 March 2020
Contents
Problem
Three young brother-sister pairs from different families need to 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 1 (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 :
Second Row: a b c
Third Row: b c a
Case :
Second Row: a c b
Third Row: c b a
Case :
Second Row: a b c
Third Row: c a b
Case :
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
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
to get our answer of
. So, the correct answer is
.
Written By: Archimedes15
Solution 2 (Easy Casework)
Lets call the siblings ,
,
,
,
, and
. We can split our problem into two cases:
There is a child of each family in each row (There is an A, B, C in each row ) or There are two children of the same family in a row.
Starting off with the first case, we see that there are ways to arrange the A,B,C. Then, we have to choose which sibling sits. There are
choices for each set of siblings meaning we have
ways to arrange that. So, there are
ways to arrange the siblings in the first row. The second row is a bit easier. We see that there are
ways to place the A sibling and each placement yields only
possibility. So, our first case has
possibilities.
In our second case, there are ways to choose which set of siblings will be in the same row, two ways to choose which set of sibling will sit in between them and
ways to choose whether it is the brother or sister. So, there
ways to arrange the first row. In the second row, however, we see that it is impossible to make everything work out. So, there are
possibilities for this case.
Thus, there are possibilities for this trip.
-Conantwiz2023
Solution 3
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 (
denotes an empty seat):
Then there are 4 choices for the second seat (,
,
, or
). Like before, 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
. Let's say WLOG that it is
. There are two ways to create a second row:
Therefore, there are possible seating arrangements.
Written by: HoloGuard1728
Solution 5
WLOG, define the three pairs of siblings to be: ,
, and
. Now, notice that you can only form a correct grouping either like this:
or this:
However, we need to consider the different orders. There are ways to order each pair (eg. the same letters) and
was to order the people each of the three pairs. Now, we can just multiply everything together, yielding:
Which is
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.