Difference between revisions of "2001 AMC 10 Problems/Problem 19"
Virjoy2001 (talk | contribs) m (→Solution 2) |
Arie-packer (talk | contribs) m (→Solution 3) |
||
| (8 intermediate revisions by 6 users not shown) | |||
| Line 5: | Line 5: | ||
<math> \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 15 \qquad \textbf{(E)}\ 18 </math> | <math> \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 15 \qquad \textbf{(E)}\ 18 </math> | ||
| − | == Solution== | + | == Solution 1 == |
Let's use [[stars and bars]]. | Let's use [[stars and bars]]. | ||
| − | Let the donuts be represented by <math> O </math>s. We wish to find all possible combinations of glazed, chocolate, and powdered donuts that give us <math> 4 </math> in all. The four donuts we want can be represented as <math> OOOO </math>. Notice that we can add two "dividers" to divide the group of donuts into three different kinds; the first will be glazed, second will be chocolate, and the third will be powdered. For example, <math> O|OO|O </math> represents one glazed, two chocolate, and one powdered. We have six objects in all, and we wish to turn two into dividers, which can be done in <math> \binom{6}{2}=15 </math> ways. Our answer is hence <math> \boxed{\textbf{(D)}\ 15} </math>. Notice that this can be generalized to get the | + | Let the donuts be represented by <math> O </math>s. We wish to find all possible combinations of glazed, chocolate, and powdered donuts that give us <math> 4 </math> in all. The four donuts we want can be represented as <math> OOOO </math>. Notice that we can add two "dividers" to divide the group of donuts into three different kinds; the first will be glazed, second will be chocolate, and the third will be powdered. For example, <math> O|OO|O </math> represents one glazed, two chocolate, and one powdered. We have six objects in all, and we wish to turn two into dividers, which can be done in <math> \binom{6}{2}=15 </math> ways. Our answer is hence <math> \boxed{\textbf{(D)}\ 15} </math>. Notice that this can be generalized to get the stars and bars (balls and urns) identity. |
==Solution 2== | ==Solution 2== | ||
| + | Similar to Solution 1, we can generalize the problem by using the stars and bars formula, yielding an answer of <math>\dbinom{4+3-1}{3-1}=\dbinom{6}{2}=\boxed{\textbf{(D)}\ 15}</math>. | ||
| + | |||
| + | ==Solution 3== | ||
Simple casework works here as well: | Simple casework works here as well: | ||
| Line 19: | Line 22: | ||
<cmath>2:1:1</cmath> | <cmath>2:1:1</cmath> | ||
| − | In three of these cases we see that there are two of the same ratios (so like two boxes would have 0), and so if we swapped those two donuts, we would have the same case. Thus we get <math>\frac{ | + | In three of these cases we see that there are two of the same ratios (so like two boxes would have <math>0</math>), and so if we swapped those two donuts, we would have the same case. Thus we get <math>\frac{3!}{2!1!}</math> for those <math>3</math> (You can also set it up and logically symmetry applies). For the other case where each ratio of donuts is different, we get the normal <math>\binom{4}{3}=6.</math> Thus, our answer is <math>3 \cdot 3+6 = \boxed{\textbf{(D) }15}</math>. |
Solution by IronicNinja | Solution by IronicNinja | ||
| − | Edit by virjoy2001 | + | Edit by virjoy2001 & Aopsthedude |
== See Also == | == See Also == | ||
Latest revision as of 16:35, 7 June 2024
Problem
Pat wants to buy four donuts from an ample supply of three types of donuts: glazed, chocolate, and powdered. How many different selections are possible?
Solution 1
Let's use stars and bars.
Let the donuts be represented by 
s. We wish to find all possible combinations of glazed, chocolate, and powdered donuts that give us 
in all. The four donuts we want can be represented as 
. Notice that we can add two "dividers" to divide the group of donuts into three different kinds; the first will be glazed, second will be chocolate, and the third will be powdered. For example, 
represents one glazed, two chocolate, and one powdered. We have six objects in all, and we wish to turn two into dividers, which can be done in 
ways. Our answer is hence 
. Notice that this can be generalized to get the stars and bars (balls and urns) identity.
Solution 2
Similar to Solution 1, we can generalize the problem by using the stars and bars formula, yielding an answer of 
.
Solution 3
Simple casework works here as well:
Set up the following ratios:
![\[4:0:0\]](http://latex.artofproblemsolving.com/b/2/2/b222b47ebe7cfd6e352308a23a9a34667a2553f0.png)
![\[3:1:0\]](http://latex.artofproblemsolving.com/1/1/5/1158e468a167f8d997a18041c3fe2e816d7e0e68.png)
![\[2:2:0\]](http://latex.artofproblemsolving.com/f/2/e/f2e0494579f7ba2614b0cd0782828af038d6dee5.png)
![\[2:1:1\]](http://latex.artofproblemsolving.com/8/b/f/8bf3ec542a0e1b7b714f52fc2ea3b30c9656673f.png)
In three of these cases we see that there are two of the same ratios (so like two boxes would have 
), and so if we swapped those two donuts, we would have the same case. Thus we get 
for those 
(You can also set it up and logically symmetry applies). For the other case where each ratio of donuts is different, we get the normal 
Thus, our answer is 
.
Solution by IronicNinja
Edit by virjoy2001 & Aopsthedude
See Also
| 2001 AMC 10 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 18 |
Followed by Problem 20 | |
| 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. 
