Difference between revisions of "2006 AIME I Problems/Problem 9"
m |
m (→Solution) |
||
Line 9: | Line 9: | ||
<math> = \log_8(a\cdot ar\cdot ar^2\cdot \cdots \cdot ar^{11}) = \log_8 (a^{12}r^{66}) </math> | <math> = \log_8(a\cdot ar\cdot ar^2\cdot \cdots \cdot ar^{11}) = \log_8 (a^{12}r^{66}) </math> | ||
− | So our question is equivalent to solving | + | So our question is equivalent to solving <math>\log_8 (a^{12}r^{66})=2006</math> for <math>a, r</math> [[positive integer]]s. |
− | |||
− | |||
− | |||
− | for <math>a, r</math> [[positive integer]]s. | ||
<math>a^{12}r^{66}=8^{2006} = (2^3)^{2006} = (2^6)^{1003}</math> so | <math>a^{12}r^{66}=8^{2006} = (2^3)^{2006} = (2^6)^{1003}</math> so |
Revision as of 19:49, 11 March 2007
Problem
The sequence is geometric with and common ratio where and are positive integers. Given that find the number of possible ordered pairs
Solution
So our question is equivalent to solving for positive integers.
so
The product of and is a power of 2. Since both numbers have to be integers, this means that and are themselves powers of 2. Now, let and :
For to be an integer, the numerator must be divisible by 11. This occurs when because . Because only even integers are being subtracted from 1003, the numerator never equals an even multiple of 11. Therefore, the numerator takes on the value of every odd multiple of 11 from 11 to 1001. Since the odd multiples are separated by a distance of 22, the number of ordered pairs that work is . (We must add 1 because both endpoints are being included.) So the answer is .