Difference between revisions of "2010 AMC 10B Problems/Problem 18"
Mathusername (talk | contribs) (→Solution) |
(→Solution) |
||
Line 4: | Line 4: | ||
<math>\textbf{(A)}\ \dfrac{1}{3} \qquad \textbf{(B)}\ \dfrac{29}{81} \qquad \textbf{(C)}\ \dfrac{31}{81} \qquad \textbf{(D)}\ \dfrac{11}{27} \qquad \textbf{(E)}\ \dfrac{13}{27}</math> | <math>\textbf{(A)}\ \dfrac{1}{3} \qquad \textbf{(B)}\ \dfrac{29}{81} \qquad \textbf{(C)}\ \dfrac{31}{81} \qquad \textbf{(D)}\ \dfrac{11}{27} \qquad \textbf{(E)}\ \dfrac{13}{27}</math> | ||
− | ==Solution== | + | ==Solution 1== |
First we factor <math>abc + ab + a</math> as <math>a(bc + b + 1)</math>, so in order for the number to be divisible by 3, either <math>a</math> is divisible by <math>3</math>, or <math>bc + b + 1</math> is divisible by <math>3</math>. | First we factor <math>abc + ab + a</math> as <math>a(bc + b + 1)</math>, so in order for the number to be divisible by 3, either <math>a</math> is divisible by <math>3</math>, or <math>bc + b + 1</math> is divisible by <math>3</math>. | ||
Line 12: | Line 12: | ||
Then the answer is <math>\frac{1}{3} + \frac{2}{3}\cdot\frac{2}{9} = \frac{13}{27}</math> or <math>\boxed{E}</math>. | Then the answer is <math>\frac{1}{3} + \frac{2}{3}\cdot\frac{2}{9} = \frac{13}{27}</math> or <math>\boxed{E}</math>. | ||
+ | |||
+ | |||
+ | ==Solution 2== | ||
+ | We see that since <math>2010</math> is divisible by <math>3</math>, the probability that any one of <math>a</math>, <math>b</math>, or <math>c</math> being divisible by <math>3</math> is <math>\frac{1}{3}</math>. Because of this, we can shrink the set of possibilities for <math>a</math>, <math>b</math>, and <math>c</math> to the set <math>\{1,2,3\}</math> without affecting the probability in question. | ||
+ | |||
+ | Listing out all possible combinations for <math>a</math>, <math>b</math>, and <math>c</math>, we see that the answer is <math>\bold{\boxed{\left( E\right) \frac{13}{27}}}</math>. | ||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2010|ab=B|num-b=17|num-a=19}} | {{AMC10 box|year=2010|ab=B|num-b=17|num-a=19}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 18:27, 13 February 2018
Contents
Problem
Positive integers , , and are randomly and independently selected with replacement from the set . What is the probability that is divisible by ?
Solution 1
First we factor as , so in order for the number to be divisible by 3, either is divisible by , or is divisible by .
We see that is divisible by with probability . We only need to calculate the probability that is divisible by .
We need or . Using some modular arithmetic, and or and . The both cases happen with probability so the total probability is .
Then the answer is or .
Solution 2
We see that since is divisible by , the probability that any one of , , or being divisible by is . Because of this, we can shrink the set of possibilities for , , and to the set without affecting the probability in question.
Listing out all possible combinations for , , and , we see that the answer is .
See Also
2010 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 17 |
Followed by Problem 19 | |
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.