Difference between revisions of "2004 AIME II Problems/Problem 10"
m |
I like pie (talk | contribs) m |
||
Line 9: | Line 9: | ||
It's clear what the pairs <math>j, k</math> can look like. If one is of the form <math>6n</math> (7 choices), the other must be of the form <math>6n + 3</math> (7 choices). If one is of the form <math>6n + 1</math> (7 choices) the other must be of the form <math>6n + 4</math> (6 choices). And if one is of the form <math>6n + 2</math> (7 choices), the other must be of the form <math>6n + 5</math> (6 choices). This means that there are <math>7\cdot 7 + 7\cdot 6 + 7\cdot 6 = 49 + 42 +42 = 133</math> total "good" numbers. | It's clear what the pairs <math>j, k</math> can look like. If one is of the form <math>6n</math> (7 choices), the other must be of the form <math>6n + 3</math> (7 choices). If one is of the form <math>6n + 1</math> (7 choices) the other must be of the form <math>6n + 4</math> (6 choices). And if one is of the form <math>6n + 2</math> (7 choices), the other must be of the form <math>6n + 5</math> (6 choices). This means that there are <math>7\cdot 7 + 7\cdot 6 + 7\cdot 6 = 49 + 42 +42 = 133</math> total "good" numbers. | ||
− | + | The [[probability]] is <math>\frac{133}{780}</math>, and the answer is <math>133 + 780 = 913</math>. | |
+ | |||
== See also == | == See also == | ||
− | + | {{AIME box|year=2004|n=II|num-b=9|num-a=11}} | |
− | |||
− | |||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] |
Revision as of 12:27, 19 April 2008
Problem
Let be the set of integers between 1 and whose binary expansions have exactly two 1's. If a number is chosen at random from the probability that it is divisible by 9 is where and are relatively prime positive integers. Find
Solution
A positive integer has exactly two 1s in its binary representation exactly when for nonnegative integers. Thus, the set is equal to the set . (The second condition ensures simultaneously that and that each such number less than is counted exactly once.) This means there are total such numbers.
Now, consider the powers of 2 mod 9: .
It's clear what the pairs can look like. If one is of the form (7 choices), the other must be of the form (7 choices). If one is of the form (7 choices) the other must be of the form (6 choices). And if one is of the form (7 choices), the other must be of the form (6 choices). This means that there are total "good" numbers.
The probability is , and the answer is .
See also
2004 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |