Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus
During AMC testing, the AoPS Wiki is in read-only mode and no edits can be made.

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

(→‎Solution)
(→‎Solution)
Line 32: Line 32:
  
 
<math>2x+11y=1003</math>
 
<math>2x+11y=1003</math>
 +
 +
<math>11y=1003-2x</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>.
  
 
== See also ==
 
== See also ==

Revision as of 14:02, 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$.

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_AIME_I_Problems/Problem_9&oldid=9164"