Difference between revisions of "2013 AMC 10A Problems/Problem 24"
m (→Solution) |
m (→Solution) |
||
Line 9: | Line 9: | ||
1. One way of scheduling all six distinct rounds could be: | 1. One way of scheduling all six distinct rounds could be: | ||
− | Round 1----> <math>AX</math> <math>BY</math> <math>CZ</math> | + | Round 1----><math>AX</math> <math>BY</math> <math>CZ</math> |
Round 2----><math>AX</math> <math>BZ</math> <math>CY</math> | Round 2----><math>AX</math> <math>BZ</math> <math>CY</math> | ||
Round 3----><math>AY</math> <math>BX</math> <math>CZ</math> | Round 3----><math>AY</math> <math>BX</math> <math>CZ</math> | ||
Line 21: | Line 21: | ||
(a) | (a) | ||
− | Round 1----> <math>AX</math> <math>BZ</math> <math>CY</math> | + | Round 1----><math>AX</math> <math>BZ</math> <math>CY</math> |
Round 2----><math>AX</math> <math>BZ</math> <math>CY</math> | Round 2----><math>AX</math> <math>BZ</math> <math>CY</math> | ||
Round 3----><math>AY</math> <math>BX</math> <math>CZ</math> | Round 3----><math>AY</math> <math>BX</math> <math>CZ</math> | ||
Line 29: | Line 29: | ||
(b) | (b) | ||
− | Round 1----> <math>AX</math> <math>BY</math> <math>CZ</math> | + | Round 1----><math>AX</math> <math>BY</math> <math>CZ</math> |
Round 2----><math>AX</math> <math>BY</math> <math>CZ</math> | Round 2----><math>AX</math> <math>BY</math> <math>CZ</math> | ||
Round 3----><math>AY</math> <math>BZ</math> <math>CX</math> | Round 3----><math>AY</math> <math>BZ</math> <math>CX</math> |
Revision as of 14:55, 27 January 2015
Central High School is competing against Northern High School in a backgammon match. Each school has three players, and the contest rules require that each player play two games against each of the other school's players. The match takes place in six rounds, with three games played simultaneously in each round. In how many different ways can the match be scheduled?
Solution
Let us label the players of the first team , , and , and those of the second team, , , and .
1. One way of scheduling all six distinct rounds could be:
Round 1----> Round 2----> Round 3----> Round 4----> Round 5----> Round 6---->
The above mentioned schedule ensures that each player of one team plays twice with each player from another team. Now you can generate a completely new schedule by permuting those rounds and that can be done in = ways.
2. One can also make the schedule in such a way that two rounds are repeated.
(a)
Round 1----> Round 2----> Round 3----> Round 4----> Round 5----> Round 6---->
(b)
Round 1----> Round 2----> Round 3----> Round 4----> Round 5----> Round 6---->
As mentioned earlier any permutation of (a) and (b) will also give us a new schedule. For both (a) and (b) the number of permutations are =
So the total number of schedules is =.
See Also
2013 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
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.