Difference between revisions of "2006 AIME I Problems/Problem 9"

(Solution)
(Solution)
Line 37: Line 37:
 
<math>y=\frac{1003-2x}{11}</math>
 
<math>y=\frac{1003-2x}{11}</math>
  
For y to be an integer, the numerator must be divisible by 2.  This occurs when <math>x=1</math> because <math>1001=91*11</math>.
+
For y to be an integer, the numerator must be divisible by 2.  This occurs when <math>x=1</math> because <math>1001=91*11</math>.  Because only even numbers 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 <math>\frac{1001-11}{22}=\frac{990}{22}=45</math>.  We must add 1 because both endpoints are being included, so the answer is therefore 46.
  
 
== See also ==
 
== See also ==

Revision as of 15:06, 3 August 2006

Problem

The sequence $a_1, a_2, \ldots$ is geometric with $a_1=a$ and common ratio $r,$ where $a$ and $r$ are positive integers. Given that $\log_8 a_1+\log_8 a_2+\cdots+\log_8 a_{12} = 2006,$ find the number of possible ordered pairs $(a,r).$



Solution

$\log_8 a_1+\log_8 a_2+\ldots+\log_8 a_{12}=     \log_8 a+log_8 (ar)+\ldots+\log_8 (ar^{11})$

$\log_8 a_1+\log_8 a_2+\ldots+\log_8 a_{12}=     \log_8 (a*ar*ar^2*\cdots*ar^{11})$

$\log_8 a_1+\log_8 a_2+\ldots+\log_8 a_{12}= \log_8 (a^{12}r^{66})$

$\log_8 (a^{12}r^{66})=2006$

$a^{12}r^{66}=8^{2006}$

$a^{12}r^{66}=(2^3)^{2006}$

$a^{2}r^{11}=2^{1003}$

The product of $a^2$ and $r^{11}$ is a power of 2. Since both numbers have to be integers, this means that a and r are also powers of 2. Now, let $a=2^x$ and $r=2^y$:

$(2^x)^2*(2^y)^{11}=2^{1003}$

$2^{2x}*2^{11y}=2^{1003}$

$2^{2x+11y}=2^{1003}$

$2x+11y=1003$

$11y=1003-2x$

$y=\frac{1003-2x}{11}$

For y to be an integer, the numerator must be divisible by 2. This occurs when $x=1$ because $1001=91*11$. Because only even numbers 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 $\frac{1001-11}{22}=\frac{990}{22}=45$. We must add 1 because both endpoints are being included, so the answer is therefore 46.

See also