Difference between revisions of "2021 AMC 12B Problems/Problem 19"
m (→Problem) |
Hyprox1413 (talk | contribs) (→Solution) |
||
Line 4: | Line 4: | ||
<math>\textbf{(A) }16 \qquad \textbf{(B) }17 \qquad \textbf{(C) }18\qquad \textbf{(D) }19 \qquad \textbf{(E) }20</math> | <math>\textbf{(A) }16 \qquad \textbf{(B) }17 \qquad \textbf{(C) }18\qquad \textbf{(D) }19 \qquad \textbf{(E) }20</math> | ||
− | ==Solution== | + | ==Solution 1== |
Suppose the dice have <math>a</math> and <math>b</math> faces, and WLOG <math>a\geq{b}</math>. Since each die has at least <math>6</math> faces, there will always be <math>6</math> ways to sum to <math>7</math>. As a result, there must be <math>\tfrac{4}{3}\cdot6=8</math> ways to sum to <math>10</math>. There are at most nine distinct ways to get a sum of <math>10</math>, which are possible whenever <math>a,b\geq{9}</math>. To achieve exactly eight ways, <math>b</math> must have <math>8</math> faces, and <math>a\geq9</math>. Let <math>n</math> be the number of ways to obtain a sum of <math>12</math>, then <math>\tfrac{n}{8a}=\tfrac{1}{12}\implies n=\tfrac{2}{3}a</math>. Since <math>b=8</math>, <math>n\leq8\implies a\leq{12}</math>. In addition to <math>3\mid{a}</math>, we only have to test <math>a=9,12</math>, of which both work. Taking the smaller one, our answer becomes <math>a+b=9+8=\boxed{\textbf{(B)}\ 17}</math>. | Suppose the dice have <math>a</math> and <math>b</math> faces, and WLOG <math>a\geq{b}</math>. Since each die has at least <math>6</math> faces, there will always be <math>6</math> ways to sum to <math>7</math>. As a result, there must be <math>\tfrac{4}{3}\cdot6=8</math> ways to sum to <math>10</math>. There are at most nine distinct ways to get a sum of <math>10</math>, which are possible whenever <math>a,b\geq{9}</math>. To achieve exactly eight ways, <math>b</math> must have <math>8</math> faces, and <math>a\geq9</math>. Let <math>n</math> be the number of ways to obtain a sum of <math>12</math>, then <math>\tfrac{n}{8a}=\tfrac{1}{12}\implies n=\tfrac{2}{3}a</math>. Since <math>b=8</math>, <math>n\leq8\implies a\leq{12}</math>. In addition to <math>3\mid{a}</math>, we only have to test <math>a=9,12</math>, of which both work. Taking the smaller one, our answer becomes <math>a+b=9+8=\boxed{\textbf{(B)}\ 17}</math>. | ||
+ | |||
+ | ==Solution 2== | ||
+ | Suppose the dice have <math>a</math> and <math>b</math> faces, and WLOG <math>a\geq{b}</math>. Note that the amount of ways to make 12 is limited by how high the combined number of faces is since it cannot exceed 24 by the answer choices. This gives us the probability of making a 12 as <cmath>\frac{a+b-11}{ab}=\frac{1}{12}</cmath> | ||
+ | Cross-multiplying, we get | ||
+ | <cmath>12a+12b-132=ab</cmath> | ||
+ | Simon's Favorite Factoring Trick now gives | ||
+ | <cmath>(a-12)(b-12)=12</cmath> | ||
+ | This narrows the possibilities down to 3 ordered pairs of <math>(a,b)</math>, which are <math>(11,24)</math>, <math>(6,10)</math>, and <math>(8,9)</math>. We can obviously ignore the first pair and test the next two straightforwardly. The last pair yields the answer: | ||
+ | <cmath>\frac{6}{72}=\frac{3}{4}\frac{9+8-9}{72}</cmath> | ||
+ | The answer is then <math>a+b=8+9=\boxed{\textbf{(B)}\ 17}</math>. | ||
+ | |||
+ | ~Hyprox1413 | ||
== Video Solution by OmegaLearn (Using Probability) == | == Video Solution by OmegaLearn (Using Probability) == |
Revision as of 14:28, 27 August 2021
Contents
[hide]Problem
Two fair dice, each with at least faces are rolled. On each face of each dice 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 the amount of ways to make 12 is limited by how high the combined number of faces is since it cannot exceed 24 by the answer choices. 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
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.