Difference between revisions of "2001 AMC 10 Problems/Problem 19"
Sakshamsethi (talk | contribs) (→Solution 3) |
Sakshamsethi (talk | contribs) (→Solution 3) |
||
Line 27: | Line 27: | ||
Since there are three choices to pick from, the value of <math>a</math> in the expression <math>{a \choose b}</math> has to be a multiple of <math>3</math>. <math>{3 \choose 4}</math> would make no sense, because that would mean: "How many ways are there to choose 4 donuts out of 3?". Next we could try <math>{6 \choose 4}</math>, which is equal to <math>15</math> ways. This works, but now let <math>a</math> be <math>9</math>. So if there were <math>9</math> donuts, (which is possible since it's a multiple of 3), the number of ways we could choose <math>4</math> donuts would be <math>{9 \choose 4} = 126</math>. Anything greater than <math>18</math> will be incorrect, since <math>18</math> is the largest number in the answer choices. Thus, our answer is <math>\boxed {15}</math>. | Since there are three choices to pick from, the value of <math>a</math> in the expression <math>{a \choose b}</math> has to be a multiple of <math>3</math>. <math>{3 \choose 4}</math> would make no sense, because that would mean: "How many ways are there to choose 4 donuts out of 3?". Next we could try <math>{6 \choose 4}</math>, which is equal to <math>15</math> ways. This works, but now let <math>a</math> be <math>9</math>. So if there were <math>9</math> donuts, (which is possible since it's a multiple of 3), the number of ways we could choose <math>4</math> donuts would be <math>{9 \choose 4} = 126</math>. Anything greater than <math>18</math> will be incorrect, since <math>18</math> is the largest number in the answer choices. Thus, our answer is <math>\boxed {15}</math>. | ||
+ | |||
+ | ~sakshamsethi | ||
== See Also == | == See Also == |
Revision as of 10:33, 28 July 2020
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
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 balls and urn (stars and bars) identity.
Solution 2
Simple casework works here as well: Set up the following ratios:
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 for those 3 (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 4C3 = 6. Thus, our answer is
Solution by IronicNinja
Solution 3
Since there are three choices to pick from, the value of in the expression has to be a multiple of . would make no sense, because that would mean: "How many ways are there to choose 4 donuts out of 3?". Next we could try , which is equal to ways. This works, but now let be . So if there were donuts, (which is possible since it's a multiple of 3), the number of ways we could choose donuts would be . Anything greater than will be incorrect, since is the largest number in the answer choices. Thus, our answer is .
~sakshamsethi
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.