Difference between revisions of "2021 AMC 12B Problems/Problem 19"
(→Solution 4) |
|||
(4 intermediate revisions by the same user not shown) | |||
Line 48: | Line 48: | ||
~MaPhyCom | ~MaPhyCom | ||
− | |||
==Solution 4== | ==Solution 4== | ||
Line 69: | Line 68: | ||
Thus <math>p(12)=\tfrac{1}{12}</math> and <math>p(7)=\tfrac{1}{12}=\tfrac{3}{4}\cdot\tfrac{1}{9}=\tfrac{3}{4}p(10)</math>. | Thus <math>p(12)=\tfrac{1}{12}</math> and <math>p(7)=\tfrac{1}{12}=\tfrac{3}{4}\cdot\tfrac{1}{9}=\tfrac{3}{4}p(10)</math>. | ||
− | Therefore <math>N=17</math> works, and since <math>N=16</math> is impossible, the minimum is <math>\boxed{17}</math>. | + | Therefore <math>N=17</math> works, and since <math>N=16</math> is impossible, the minimum is <math>\boxed{(\textbf{B})\ 17}</math>. |
''~STIDE'' | ''~STIDE'' | ||
Line 77: | Line 76: | ||
~MathProblemSolvingSkills | ~MathProblemSolvingSkills | ||
− | |||
− | |||
− | |||
== Video Solution by OmegaLearn (Using Probability) == | == Video Solution by OmegaLearn (Using Probability) == |
Latest revision as of 16:22, 18 August 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
Solution 4
Let the two dice have at least six faces each, and let their face counts sum to . We seek the minimum possible
such that
and
.
First try . Then the possible face-count pairs
with
are
,
,
. For
to be possible, the total outcomes
must be a multiple of 12. But
and
are not multiples of 12, so
and
are impossible.
For , there are 60 outcomes. The combinations that sum to 12 are (2,10), (3,9), (4,8), (5,7), (6,6), five in total, giving
.
The combinations that sum to 10 are (1,9), (2,8), (3,7), (4,6), (5,5), (6,4), six in total, giving
.
The combinations that sum to 7 are (1,6), (2,5), (3,4), (4,3), (5,2), (6,1), also six in total, giving
.
So
, which does not satisfy the condition. Hence
is impossible.
Next try . The possible pairs are
,
,
. Again,
must be a multiple of 12, but
and
are not; discard these.
For , there are 72 outcomes.
The combinations that sum to 12 are (3,9), (4,8), (5,7), (6,6), (7,5), (8,4), six in total, so
.
The combinations that sum to 10 are (1,9), (2,8), (3,7), (4,6), (5,5), (6,4), (7,3), (8,2), eight in total, so
.
The combinations that sum to 7 are (1,6), (2,5), (3,4), (4,3), (5,2), (6,1), six in total, so
.
Thus and
.
Therefore works, and since
is impossible, the minimum is
.
~STIDE
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.