Difference between revisions of "2004 AMC 8 Problems/Problem 17"
Phoenixfire (talk | contribs) (→Solution 3) |
Phoenixfire (talk | contribs) (→Solution 3) |
||
(8 intermediate revisions by the same user not shown) | |||
Line 9: | Line 9: | ||
==Solution 2== | ==Solution 2== | ||
Like in solution 1, for each person to have at least one pencil, assign one of the pencil to each of the three friends so that you have <math>3</math> left. In partitioning the remaining <math>3</math> pencils into <math>3</math> distinct groups, use number of non-negetive integral soutions. | Like in solution 1, for each person to have at least one pencil, assign one of the pencil to each of the three friends so that you have <math>3</math> left. In partitioning the remaining <math>3</math> pencils into <math>3</math> distinct groups, use number of non-negetive integral soutions. | ||
− | Let the three friends be <math>a | + | Let the three friends be <math>a, b, c</math> repectively. |
− | <math>a | + | <math>a + b + c = 3</math> |
The total being 3 and 2 plus signs, which implies | The total being 3 and 2 plus signs, which implies | ||
<math>\binom{3+2}{3} = \binom{5}{3} = \boxed{\textbf{(D)}\ 10}</math>. | <math>\binom{3+2}{3} = \binom{5}{3} = \boxed{\textbf{(D)}\ 10}</math>. | ||
− | Solution by | + | Solution by [[User:phoenixfire|phoenixfire]] |
==Solution 3== | ==Solution 3== | ||
Line 21: | Line 21: | ||
Let the three friends be <math>a</math>, <math>b</math>, <math>c</math> repectively. | Let the three friends be <math>a</math>, <math>b</math>, <math>c</math> repectively. | ||
− | Case <math>1</math> | + | <math>a + b + c = 3</math>, |
− | <math> | + | |
− | <math>a</math> | + | |
− | <math>b</math> | + | Case <math>1:a=0</math>, |
− | <math> | + | |
− | + | <math>b + c = 3</math>, | |
− | <math>c</math> = | + | |
− | + | <math>b = 0,1,2,3</math> , | |
+ | |||
+ | <math>c = 3,2,1,0</math>, | ||
+ | |||
+ | <math>\boxed{\textbf\ 4}</math> solutions. | ||
+ | |||
+ | |||
+ | Case <math>2:a=1</math>, | ||
+ | |||
+ | <math>1 + b + c = 3</math>, | ||
+ | |||
+ | <math>b + c = 2</math>, | ||
+ | |||
+ | <math>b = 0,1,2</math> , | ||
+ | |||
+ | <math>c = 2,1,0</math> , | ||
+ | |||
+ | <math>\boxed{\textbf\ 3}</math> solutions. | ||
+ | |||
+ | |||
+ | Case <math>3:a= 2</math>, | ||
+ | |||
+ | <math>2 + b + c = 3</math>, | ||
+ | |||
+ | <math>b + c = 1</math>, | ||
+ | |||
+ | <math>b = 0,1</math>, | ||
+ | |||
+ | <math>c = 1,0</math>, | ||
+ | |||
+ | <math>\boxed{\textbf\ 2}</math> solutions. | ||
+ | |||
+ | |||
+ | Case <math>4:a = 3</math>, | ||
− | + | <math>3 + b + c = 3</math>, | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | + | <math>b + c = 0</math>, | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | + | <math>b = 0</math>, | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | + | <math>c = 0</math>, | |
− | + | <math>\boxed{\textbf\ 1}</math> solution. | |
− | + | Therefore there will be a total of 10 solutions. <math>\boxed{\textbf{(D)}\ 10}</math>. | |
+ | Solution by [[User:phoenixfire|phoenixfire]] | ||
==See Also== | ==See Also== | ||
{{AMC8 box|year=2004|num-b=16|num-a=18}} | {{AMC8 box|year=2004|num-b=16|num-a=18}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 02:29, 12 August 2020
Problem
Three friends have a total of identical pencils, and each one has at least one pencil. In how many ways can this happen?
Solution 1
For each person to have at least one pencil, assign one of the pencil to each of the three friends so that you have left. In partitioning the remaining pencils into distinct groups, use Ball-and-urn to find the number of possibilities is .
Solution 2
Like in solution 1, for each person to have at least one pencil, assign one of the pencil to each of the three friends so that you have left. In partitioning the remaining pencils into distinct groups, use number of non-negetive integral soutions. Let the three friends be repectively.
The total being 3 and 2 plus signs, which implies .
Solution by phoenixfire
Solution 3
Like in solution 1 and solution 2, for each person to have at least one pencil, assign one of the pencil to each of the three friends so that you have left. In partitioning the remaining pencils into distinct groups use casework. Let the three friends be , , repectively.
,
Case ,
,
,
,
solutions.
Case ,
,
,
,
,
solutions.
Case ,
,
,
,
,
solutions.
Case ,
,
,
,
,
solution.
Therefore there will be a total of 10 solutions. . Solution by phoenixfire
See Also
2004 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
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 AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.