Difference between revisions of "2006 AIME I Problems/Problem 9"
(solution cleanup) |
(→Solution) |
||
Line 16: | Line 16: | ||
For <math>y</math> to be an integer, the [[numerator]] must be [[divisible]] by <math>11</math>. This occurs when <math>x=1</math> because <math>1001=91*11</math>. Because only [[even integer]]s are being subtracted from <math>1003</math>, the numerator never equals an even [[multiple]] of <math>11</math>. Therefore, the numerator takes on the value of every [[odd integer | odd]] multiple of <math>11</math> from <math>11</math> to <math>1001</math>. Since the odd multiples are separated by a distance of <math>22</math>, the number of ordered pairs that work is <math>1 + \frac{1001-11}{22}=1 + \frac{990}{22}=46</math>. (We must add 1 because both endpoints are being included.) So the answer is <math>\boxed{046}</math>. | For <math>y</math> to be an integer, the [[numerator]] must be [[divisible]] by <math>11</math>. This occurs when <math>x=1</math> because <math>1001=91*11</math>. Because only [[even integer]]s are being subtracted from <math>1003</math>, the numerator never equals an even [[multiple]] of <math>11</math>. Therefore, the numerator takes on the value of every [[odd integer | odd]] multiple of <math>11</math> from <math>11</math> to <math>1001</math>. Since the odd multiples are separated by a distance of <math>22</math>, the number of ordered pairs that work is <math>1 + \frac{1001-11}{22}=1 + \frac{990}{22}=46</math>. (We must add 1 because both endpoints are being included.) So the answer is <math>\boxed{046}</math>. | ||
+ | |||
+ | -------------- | ||
+ | Another way is to write | ||
+ | |||
+ | <math>x = \frac{1003-11y}2</math> | ||
+ | |||
+ | Since <math>1003/11 = 91 + 2/11</math>, the answer is just the number of odd integers in <math>[1,91]</math>, which is <math>46</math>. | ||
== See also == | == See also == |
Revision as of 11:02, 10 January 2009
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 . This occurs when because . Because only even integers are being subtracted from , the numerator never equals an even multiple of . Therefore, the numerator takes on the value of every odd multiple of from to . Since the odd multiples are separated by a distance of , the number of ordered pairs that work is . (We must add 1 because both endpoints are being included.) So the answer is .
Another way is to write
Since , the answer is just the number of odd integers in , which is .
See also
2006 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |