Difference between revisions of "2018 AMC 10B Problems/Problem 9"
(→Solution 1) |
Mathycoder (talk | contribs) m (→Solution 1) |
||
(8 intermediate revisions by 8 users not shown) | |||
Line 23: | Line 23: | ||
Now imagine <math>7</math> piles with <math>6</math> blocks each. The number of ways to take <math>3</math> blocks away (making the sum <math>7\cdot 6-3=39</math>) is also <math>\binom {3+7-1}{7-1}=84</math>. | Now imagine <math>7</math> piles with <math>6</math> blocks each. The number of ways to take <math>3</math> blocks away (making the sum <math>7\cdot 6-3=39</math>) is also <math>\binom {3+7-1}{7-1}=84</math>. | ||
+ | |||
+ | correction to the add-on: the die need a positive value. We first give every die 1 so we have <math>10-7=3</math> "balls" left to put into the 7 more bins/die. a dice can have a value of 0 for the # of added balls. Thus, from stars and bars it follows that there are <math>\binom{7+3-1}{7-1}=84</math> ways | ||
+ | |||
+ | ~mathboy282 | ||
==Solution 2== | ==Solution 2== | ||
Line 38: | Line 42: | ||
By: epicmonster | By: epicmonster | ||
+ | |||
+ | Revised solution by Williamgolly (includes bijections): | ||
+ | Notice that we first must have at least a 1 on each die. Now, we form the following bijection: biject each value on the original die, say <math>x</math> to a value <math>7-x</math> on the new die. Notice how now we need to 'take away' 3 from seven dies that all show 6. Therefore, the answer is 39. | ||
==Solution 4== | ==Solution 4== | ||
− | The expected value of the sums of the die rolls is <math>3.5\cdot7=24.5</math>, and since the probabilities should be distributed symmetrically on both sides of <math>24.5</math>, the answer is <math>24.5+24.5-10=39</math>, which is <math>\boxed{\textbf{(D)} \text{ 39}}</math>. | + | The expected value of the sums of the die rolls is <math>3.5\cdot7=24.5</math>, and since the probabilities should be distributed symmetrically on both sides of <math>24.5</math>, the answer is <math>24.5+(24.5-10)=39</math>, which is <math>\boxed{\textbf{(D)} \text{ 39}}</math>. |
By: dajeff | By: dajeff | ||
Line 83: | Line 90: | ||
==Related Problems== | ==Related Problems== | ||
− | There is | + | There is similar to problem 11 of the AMC 10A in the same year, which is almost a replica of the problem mentioned by Zeric Hang in the Note section: |
− | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_11 | + | https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_11 |
==Video Solution== | ==Video Solution== |
Latest revision as of 11:48, 1 November 2024
Contents
Problem
The faces of each of standard dice are labeled with the integers from to . Let be the probabilities that when all dice are rolled, the sum of the numbers on the top faces is . What other sum occurs with the same probability as ?
Solution 1
It can be seen that the probability of rolling the smallest number possible is the same as the probability of rolling the largest number possible, the probability of rolling the second smallest number possible is the same as the probability of rolling the second largest number possible, and so on. This is because the number of ways to add a certain number of ones to an assortment of ones is the same as the number of ways to take away a certain number of ones from an assortment of s.
So, we can match up the values to find the sum with the same probability as . We can start by noticing that is the smallest possible roll and is the largest possible roll. The pairs with the same probability are as follows:
However, we need to find the number that matches up with . So, we can stop at and deduce that the sum with equal probability as is . So, the correct answer is , and we are done.
Written By: Archimedes15
Add-on by ike.chen: to see how the number of ways to roll and are the same, consider this argument:
Each of the dice needs to have a nonnegative value; it follows that the number of ways to roll is by stars and bars. , so there's no chance that any dice has a value .
Now imagine piles with blocks each. The number of ways to take blocks away (making the sum ) is also .
correction to the add-on: the die need a positive value. We first give every die 1 so we have "balls" left to put into the 7 more bins/die. a dice can have a value of 0 for the # of added balls. Thus, from stars and bars it follows that there are ways
~mathboy282
Solution 2
Let's call the unknown value . By symmetry, we realize that the difference between 10 and the minimum value of the rolls is equal to the difference between the maximum and . So,
and our answer is By: Soccer_JAMS
Solution 3
For the sums to have equal probability, the average sum of both sets of dies has to be . Since having is similar to not having , you just subtract 10 from the expected total sum. so the answer is
By: epicmonster
Revised solution by Williamgolly (includes bijections): Notice that we first must have at least a 1 on each die. Now, we form the following bijection: biject each value on the original die, say to a value on the new die. Notice how now we need to 'take away' 3 from seven dies that all show 6. Therefore, the answer is 39.
Solution 4
The expected value of the sums of the die rolls is , and since the probabilities should be distributed symmetrically on both sides of , the answer is , which is .
By: dajeff
Solution 5
Another faster and easier way of doing this, without using almost any math at all, is realizing that the possible sums are . By symmetry, (and doing a few similar problems in the past), you can realize that the probability of obtaining is the same as the probability of obtaining , and on and on and on. This means that , and thus the correct answer is .
By: fhdsaukfaioifk
Note
Calculating the probability of getting a sum of is also easy. There are cases:
Case :
cases
Case :
cases
Case :
cases
The probability is .
Calculating :
Therefore, the probability is
~Zeric Hang (Main writer) and fhdsaukfaioifk (Editor)
Related Problems
There is similar to problem 11 of the AMC 10A in the same year, which is almost a replica of the problem mentioned by Zeric Hang in the Note section: https://artofproblemsolving.com/wiki/index.php/2018_AMC_10A_Problems/Problem_11
Video Solution
~savannahsolver
See Also
2018 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
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.