Difference between revisions of "2018 AMC 10A Problems/Problem 11"
(→Solution 5 (Stars and Bars)) |
(→Solution 1) |
||
(12 intermediate revisions by 6 users not shown) | |||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | When 7 fair standard 6-sided dice are thrown, the probability that the sum of the numbers on the top faces is 10 can be written as <cmath>\frac{n}{6^7},</cmath>where <math>n</math> is a positive integer. What is <math>n</math>? | + | When <math>7</math> fair standard <math>6</math>-sided dice are thrown, the probability that the sum of the numbers on the top faces is <math>10</math> can be written as <cmath>\frac{n}{6^{7}},</cmath> where <math>n</math> is a positive integer. What is <math>n</math>? |
− | <math>\textbf{(A) } | + | <math> |
+ | \textbf{(A) }42\qquad | ||
+ | \textbf{(B) }49\qquad | ||
+ | \textbf{(C) }56\qquad | ||
+ | \textbf{(D) }63\qquad | ||
+ | \textbf{(E) }84\qquad | ||
+ | </math> | ||
== Solutions == | == Solutions == | ||
===Solution 1=== | ===Solution 1=== | ||
− | The minimum number that can be shown on the face of a die is 1, so the least possible sum of the top faces of the 7 | + | The minimum number that can be shown on the face of a die is <math>1</math>, so the least possible sum of the top faces of the 7 dice is <math>7</math>. |
− | In order for the sum to be exactly 10, 1 to 3 dices' | + | In order for the sum to be exactly <math>10</math>, 1 to 3 dices' numbers on the top face must be increased by a total of <math>3</math>. |
There are 3 ways to do so: | There are 3 ways to do so: | ||
− | 3, 2+1, and 1+1+1 | + | <math>3</math>, <math>2+1</math>, and <math>1+1+1</math> |
There are <math>7</math> for Case 1, <math>7\cdot 6 = 42</math> for Case 2, and <math>\frac{7\cdot 6\cdot 5}{3!} = 35</math> for Case 3. | There are <math>7</math> for Case 1, <math>7\cdot 6 = 42</math> for Case 2, and <math>\frac{7\cdot 6\cdot 5}{3!} = 35</math> for Case 3. | ||
Line 19: | Line 25: | ||
===Solution 2=== | ===Solution 2=== | ||
− | Rolling a sum of 10 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 | + | Rolling a sum of <math>10</math> 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 <math>\dbinom{9}{3}=\boxed{\textbf{(E) } 84}</math> ways. |
===Solution 3=== | ===Solution 3=== | ||
Line 37: | Line 43: | ||
===Solution 5 (Stars and Bars)=== | ===Solution 5 (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 <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 6 (Solution 5 but more clearer and compact) === | ||
+ | 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 | ||
+ | |||
+ | ==Video Solution 1== | ||
+ | https://youtu.be/HVn1WV80ZIU | ||
+ | |||
+ | ~savannahsolver | ||
+ | |||
+ | == Video Solution 2== | ||
+ | https://youtu.be/5UojVH4Cqqs?t=5381 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
== See Also == | == See Also == |
Latest revision as of 17:05, 6 August 2021
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
The minimum number that can be shown on the face of a die is , so the least possible sum of the top faces of the 7 dice is .
In order for the sum to be exactly , 1 to 3 dices' numbers on the top face must be increased by a total of .
There are 3 ways to do so: , , and
There are for Case 1, for Case 2, and for Case 3.
Therefore, the answer is
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
Add possibilities. There are ways to sum to , listed below.
Add up the possibilities: .
Thus we have repeated Solution 1 exactly, but with less explanation.
Solution 4 (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 5 (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 6 (Solution 5 but more clearer and compact)
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.