Difference between revisions of "2021 AMC 12B Problems/Problem 19"
(→Solution 3 (Logic)) |
|||
(One intermediate revision by the same user not shown) | |||
Line 22: | Line 22: | ||
==Solution 3 (Logic)== | ==Solution 3 (Logic)== | ||
Notice that | Notice that | ||
+ | <cmath> | ||
\begin{align*} | \begin{align*} | ||
7&=1+6 \\ | 7&=1+6 \\ | ||
Line 27: | Line 28: | ||
&=6+1 | &=6+1 | ||
\end{align*} | \end{align*} | ||
+ | </cmath> | ||
are the only cases that could possibly form 7. In another words, regardless of the number of faces for each dice, 6 is the number of cases that could form a rolling sum of 7. | are the only cases that could possibly form 7. In another words, regardless of the number of faces for each dice, 6 is the number of cases that could form a rolling sum of 7. | ||
− | + | ||
+ | |||
Because the value of the total combination for both are the same, we could infer that the number of cases of having a rolling sum of 10 is <math>\frac{4}{3}\cdot6=8</math>. With the number 8, we could also deduce that one dice has 8 sides and the other has at least 9 sides. Thence trial and error could be utilized. | Because the value of the total combination for both are the same, we could infer that the number of cases of having a rolling sum of 10 is <math>\frac{4}{3}\cdot6=8</math>. With the number 8, we could also deduce that one dice has 8 sides and the other has at least 9 sides. Thence trial and error could be utilized. | ||
− | + | ||
+ | |||
Since 9 is the next smallest number, the case could be tested. | Since 9 is the next smallest number, the case could be tested. | ||
+ | <cmath> | ||
\begin{align*} | \begin{align*} | ||
12&=3+9 \\ | 12&=3+9 \\ | ||
Line 38: | Line 43: | ||
&=8+4 | &=8+4 | ||
\end{align*} | \end{align*} | ||
+ | </cmath> | ||
<math>\frac{6}{8\cdot9}=\frac{1}{12}</math> is also true. Therefore, <math>8+9=\boxed{\textbf{(B) }17}</math> | <math>\frac{6}{8\cdot9}=\frac{1}{12}</math> is also true. Therefore, <math>8+9=\boxed{\textbf{(B) }17}</math> | ||
+ | |||
~MaPhyCom | ~MaPhyCom |
Latest revision as of 04:26, 5 June 2025
Contents
Problem
Two fair dice, each with at least faces are rolled. On each face of each die is printed a distinct integer from
to the number of faces on that die, inclusive. The probability of rolling a sum of
is
of the probability of rolling a sum of
and the probability of rolling a sum of
is
. What is the least possible number of faces on the two dice combined?
Solution 1
Suppose the dice have and
faces, and WLOG
. Since each die has at least
faces, there will always be
ways to sum to
. As a result, there must be
ways to sum to
. There are at most nine distinct ways to get a sum of
, which are possible whenever
. To achieve exactly eight ways,
must have
faces, and
. Let
be the number of ways to obtain a sum of
, then
. Since
,
. In addition to
, we only have to test
, of which both work. Taking the smaller one, our answer becomes
.
Solution 2
Suppose the dice have and
faces, and WLOG
. Note that if
since they are both
, there is one way to make
, and incrementing
or
by one will add another way. This gives us the probability of making a 12 as
Cross-multiplying, we get
Simon's Favorite Factoring Trick now gives
This narrows the possibilities down to 3 ordered pairs of
, which are
,
, and
. We can obviously ignore the first pair and test the next two straightforwardly. The last pair yields the answer:
The answer is then
.
~Hyprox1413
Solution 3 (Logic)
Notice that
are the only cases that could possibly form 7. In another words, regardless of the number of faces for each dice, 6 is the number of cases that could form a rolling sum of 7.
Because the value of the total combination for both are the same, we could infer that the number of cases of having a rolling sum of 10 is . With the number 8, we could also deduce that one dice has 8 sides and the other has at least 9 sides. Thence trial and error could be utilized.
Since 9 is the next smallest number, the case could be tested.
is also true. Therefore,
~MaPhyCom
Video Solution
~MathProblemSolvingSkills
Video Solution by OmegaLearn (Using Probability)
~ pi_is_3.14
See Also
2021 AMC 12B (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 12 Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.