Difference between revisions of "2018 AMC 10A Problems/Problem 11"
Mathkiddie (talk | contribs) (→Solution 5 (Stars and Bars)) |
Mathkiddie (talk | contribs) (→Solution 6 (Solution 5 but more clearer and compact)) |
||
Line 31: | Line 31: | ||
If we let each number take its minimum value of 1, we will get 7 as the minimum sum. So we can do <math>10</math> - <math>7</math> = <math>3</math> to find the number of balls we need to distribute to get three more added to the minimum to get 10, so the problem is asking how many ways can you put <math>3</math> balls into <math>7</math> boxes. From there we get <math>\binom{7+3-1}{7-1}=\binom{9}{6}=\boxed{84}</math> | If we let each number take its minimum value of 1, we will get 7 as the minimum sum. So we can do <math>10</math> - <math>7</math> = <math>3</math> to find the number of balls we need to distribute to get three more added to the minimum to get 10, so the problem is asking how many ways can you put <math>3</math> balls into <math>7</math> boxes. From there we get <math>\binom{7+3-1}{7-1}=\binom{9}{6}=\boxed{84}</math> | ||
− | === | + | ===Solution 5 === |
Assume each die has value 1. Then we have <math>10-(1 \cdot 7)=3</math> left. This is to be split among 7 die. By stars and bars, we have <math>\binom{3+7-1}{3}=\binom{9}{3}=\boxed{84}.</math> ~mathboy282 | Assume each die has value 1. Then we have <math>10-(1 \cdot 7)=3</math> left. This is to be split among 7 die. By stars and bars, we have <math>\binom{3+7-1}{3}=\binom{9}{3}=\boxed{84}.</math> ~mathboy282 | ||
Revision as of 22:07, 31 October 2022
Contents
Problem
When fair standard
-sided dice are thrown, the probability that the sum of the numbers on the top faces is
can be written as
where
is a positive integer. What is
?
Solutions
Solution 1
Add possibilities. There are ways to sum to
, listed below.
Add up the possibilities: .
Solution 2
Rolling a sum of with 7 dice can be represented with stars and bars, with 10 stars and 6 bars. Each star represents one of the dots on the dices' faces and the bars represent separation between different dice. However, we must note that each die must have at least one dot on a face, so there must already be 7 stars predetermined. We are left with 3 stars and 6 bars, which we can rearrange in
ways.
Solution 3 (overkill)
We can use generating functions, where is the function for each die. We want to find the coefficient of
in
, which is the coefficient of
in
. This evaluates to
Solution 4 (Stars and Bars)
If we let each number take its minimum value of 1, we will get 7 as the minimum sum. So we can do -
=
to find the number of balls we need to distribute to get three more added to the minimum to get 10, so the problem is asking how many ways can you put
balls into
boxes. From there we get
Solution 5
Assume each die has value 1. Then we have left. This is to be split among 7 die. By stars and bars, we have
~mathboy282
Video Solution 1
~savannahsolver
Video Solution 2
https://youtu.be/5UojVH4Cqqs?t=5381
~ pi_is_3.14
See Also
2018 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
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.