Difference between revisions of "2019 AIME II Problems/Problem 5"
Davidstigant (talk | contribs) m (→Solution 2) |
Davidstigant (talk | contribs) m (→Solution 2) |
||
Line 11: | Line 11: | ||
==Solution 2== | ==Solution 2== | ||
− | [[File:Ambassador_Table.png | + | [[File:Ambassador_Table.png|200px]] |
In the diagram, the seats are numbered 1...12. Rather than picking seats for each person, however, each ambassador/assistant team picks a gap between the seats (A...L) and the ambassador sits in the odd seat while the assistant sits in the even seat. For example, if team 1 picks gap C then Ambassador 1 will sit in seat 3 while assistant 1 will sit in seat 2. No two teams can pick adjacent gaps. For example, if team 1 chooses gap C then team 2 cannot pick gaps B or D. In the diagram, the teams have picked gaps C, F, H and J. Note that the gap-gaps - distances between the chosen gaps - (in the diagram, 2, 1, 1, 4) must sum to 8. So, to get the number of seatings, we: | In the diagram, the seats are numbered 1...12. Rather than picking seats for each person, however, each ambassador/assistant team picks a gap between the seats (A...L) and the ambassador sits in the odd seat while the assistant sits in the even seat. For example, if team 1 picks gap C then Ambassador 1 will sit in seat 3 while assistant 1 will sit in seat 2. No two teams can pick adjacent gaps. For example, if team 1 chooses gap C then team 2 cannot pick gaps B or D. In the diagram, the teams have picked gaps C, F, H and J. Note that the gap-gaps - distances between the chosen gaps - (in the diagram, 2, 1, 1, 4) must sum to 8. So, to get the number of seatings, we: | ||
1. Choose a gap for team 1 (<math>12</math> options) | 1. Choose a gap for team 1 (<math>12</math> options) |
Revision as of 10:06, 25 March 2019
Contents
Problem
Four ambassadors and one advisor for each of them are to be seated at a round table with chairs numbered in order to . Each ambassador must sit in an even-numbered chair. Each advisor must sit in a chair adjacent to his or her ambassador. There are ways for the people to be seated at the table under these conditions. Find the remainder when is divided by .
Solution
There are ambassadors and there are seats for them. So we consider the position of the blank seats. There are kinds of versions: If the two seats are adjacent to each other, there are options, and the ambassadors are sitting in four adjacent seats, and there are five seats that their advisors can sit. Choose any of them and the advisors’ seats are fixed, so there are kinds of solutions for the advisors to sit. And that’s a if we don’t consider the order of the ambassadors. We can also get that if the blank seats are opposite, it will be , if they are not adjacent and not opposite, it will be . So the total is And the remainder is
Solution 2
In the diagram, the seats are numbered 1...12. Rather than picking seats for each person, however, each ambassador/assistant team picks a gap between the seats (A...L) and the ambassador sits in the odd seat while the assistant sits in the even seat. For example, if team 1 picks gap C then Ambassador 1 will sit in seat 3 while assistant 1 will sit in seat 2. No two teams can pick adjacent gaps. For example, if team 1 chooses gap C then team 2 cannot pick gaps B or D. In the diagram, the teams have picked gaps C, F, H and J. Note that the gap-gaps - distances between the chosen gaps - (in the diagram, 2, 1, 1, 4) must sum to 8. So, to get the number of seatings, we: 1. Choose a gap for team 1 ( options) 2. Choose 3 other gaps around the table with positive gap-gaps. The number of ways to do this is the number of ways to partition 8 with 4 positive integers. This is the same as partitioning 4 with 4 non-negative integers, and using stars-and-bars, this is 3. Place the other 3 teams in the chosen gaps ( permutations) So the total is And the remainder is
See Also
2019 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.