Difference between revisions of "2005 AMC 12A Problems/Problem 23"
Armalite46 (talk | contribs) m (→Solution) |
Sevenoptimus (talk | contribs) m (Improved formatting of problem statement and solution, and slightly improved explanation in the solution) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Two distinct | + | Two distinct numbers <math>a</math> and <math>b</math> are chosen randomly from the set <math>\{2, 2^2, 2^3, \ldots, 2^{25}\}</math>. What is the probability that <math>\log_{a}b</math> is an integer? |
− | <math>\mathrm{(A)}\ \frac{2}{25}\qquad \mathrm{(B)}\ \frac{31}{300}\qquad \mathrm{(C)}\ \frac{13}{100}\qquad \mathrm{(D)}\ \frac{7}{50}\qquad \mathrm{(E)}\ \frac | + | <math>\mathrm{(A)}\ \frac{2}{25}\qquad \mathrm{(B)}\ \frac{31}{300}\qquad \mathrm{(C)}\ \frac{13}{100}\qquad \mathrm{(D)}\ \frac{7}{50}\qquad \mathrm{(E)}\ \frac{1}{2}</math> |
== Solution == | == Solution == | ||
− | Let <math>\ | + | Let <math>\log_{a}b = z</math>, so <math>a^z = b</math>. Define <math>a = 2^x</math>, <math>b = 2^y</math>; then <math>\left(2^x\right)^z = 2^{xz}= 2^y</math>, so <math>x \mid y</math>. Here we can just make a table and count the number of values of <math>y</math> per value of <math>x</math>. The largest possible value of <math>x</math> is <math>12</math>, and so we get <math>\sum_{x=1}^{12} \left\lfloor\frac{25}{x}-1\right\rfloor = 24 + 11 + 7 + 5 + 4 + 3 + 2 + 2 + 1 + 1 + 1 + 1 = 62</math>. |
− | The total number of ways to pick two distinct numbers is <math>\frac{25!}{(25-2)!}= 25 \cdot 24 = 600</math>, so we get a probability of <math>\frac{62}{600} = \boxed{\textbf{(B) }\frac{31}{300}}</math>. | + | The total number of ways to pick two distinct numbers (where the order matters) is <math>\frac{25!}{(25-2)!}= 25 \cdot 24 = 600</math>, so we get a probability of <math>\frac{62}{600} = \boxed{\textbf{(B) }\frac{31}{300}}</math>. |
== See also == | == See also == |
Latest revision as of 15:11, 1 July 2025
Problem
Two distinct numbers and
are chosen randomly from the set
. What is the probability that
is an integer?
Solution
Let , so
. Define
,
; then
, so
. Here we can just make a table and count the number of values of
per value of
. The largest possible value of
is
, and so we get
.
The total number of ways to pick two distinct numbers (where the order matters) is , so we get a probability of
.
See also
2005 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 22 |
Followed by Problem 24 |
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.