Difference between revisions of "2024 AMC 10A Problems/Problem 9"
m (→Solution 1) |
|||
| Line 6: | Line 6: | ||
== Solution 1== | == Solution 1== | ||
| − | The number of ways in which we can choose the juniors for the team are <math>{6\choose2}{4\choose2}{2\choose2}=90</math>. Similarly, the number of ways to choose the seniors are the same, so the total is <math>90\cdot90=8100</math>. But we must divide the number of permutations of three teams, which is <math>3!</math>. Thus the answer is <math>\frac{8100}{3!}=\frac{8100}{6}=\boxed{\textbf{(B) }1350}</math>. | + | The number of ways in which we can choose the juniors for the team are <math>{6\choose2}{4\choose2}{2\choose2}=15\cdot6\cdot1=90</math>. Similarly, the number of ways to choose the seniors are the same, so the total is <math>90\cdot90=8100</math>. But we must divide the number of permutations of three teams, which is <math>3!</math>. Thus the answer is <math>\frac{8100}{3!}=\frac{8100}{6}=\boxed{\textbf{(B) }1350}</math>. |
~eevee9406 | ~eevee9406 | ||
| + | ~small edits by NSAoPS | ||
== Video Solution by Pi Academy == | == Video Solution by Pi Academy == | ||
Revision as of 17:08, 9 November 2024
Contents
Problem
In how many ways can 
juniors and seniors form 
disjoint teams of 
people so
that each team has 
juniors and seniors?
Solution 1
The number of ways in which we can choose the juniors for the team are 
. Similarly, the number of ways to choose the seniors are the same, so the total is 
. But we must divide the number of permutations of three teams, which is 
. Thus the answer is 
.
~eevee9406 ~small edits by NSAoPS
Video Solution by Pi Academy
https://youtu.be/6qYaJsgqkbs?si=K2Ebwqg-Ro8Yqoiv
Video Solution 1 by Power Solve
https://youtu.be/j-37jvqzhrg?si=IBSPzNSvdIodGvZ7&t=1145
See also
| 2024 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem 8 |
Followed by Problem 10 | |
| 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. 
