Difference between revisions of "2000 AIME I Problems/Problem 6"
Darkprince (talk | contribs) |
(edit conflict again!) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | For how many ordered | + | For how many [[ordered pair]]s <math>(x,y)</math> of [[integer]]s is it true that <math>0 < x < y < 10^{6}</math> and that the [[arithmetic mean]] of <math>x</math> and <math>y</math> is exactly <math>2</math> more than the [[geometric mean]] of <math>x</math> and <math>y</math>? |
== Solution == | == Solution == | ||
− | + | <cmath>\begin{eqnarray*} | |
+ | \frac{x+y}{2} &=& \sqrt{xy} + 2\\ | ||
+ | x+y-4 &=& 2\sqrt{xy}\\ | ||
+ | y - 2\sqrt{xy} + x &=& 4\\ | ||
+ | \sqrt{y} - \sqrt{x} &=& \pm 2\end{eqnarray*}</cmath> | ||
− | + | For simplicity, we can count how many valid pairs of <math>(\sqrt{x},\sqrt{y})</math> that satisfy our equation. | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
+ | The maximum that <math>\sqrt{y}</math> can be is <math>10^3 - 1 = 999</math> because <math>\sqrt{y}</math> must be an integer (this is because <math>\sqrt{y} - \sqrt{x} = 2</math>, an integer). Then <math>\sqrt{x} = 997</math>, and we continue this downward until <math>\sqrt{y} = 3</math>, in which case <math>\sqrt{x} = 1</math>. The number of pairs of <math>(\sqrt{x},\sqrt{y})</math>, and so <math>(x,y)</math> is then <math>\boxed{997}</math>. | ||
+ | <!-- solution lost in edit conflict - azjps - | ||
+ | Since <math>y>x</math>, it follows that each ordered pair <math>(x,y) = (n^2, (n+2)^2)</math> satisfies this equation. The minimum value of <math>x</math> is <math>1</math> and the maximum value of <math>y = 999^2</math> which would make <math>x = 997^2</math>. Thus <math>x</math> can be any of the squares between <math>1</math> and <math>997^2</math> inclusive and the answer is <math>\boxed{997}</math>. | ||
+ | --> | ||
== See also == | == See also == | ||
{{AIME box|year=2000|n=I|num-b=5|num-a=7}} | {{AIME box|year=2000|n=I|num-b=5|num-a=7}} | ||
+ | |||
+ | [[Category:Intermediate Algebra Problems]] |
Revision as of 17:12, 31 December 2007
Problem
For how many ordered pairs of integers is it true that and that the arithmetic mean of and is exactly more than the geometric mean of and ?
Solution
For simplicity, we can count how many valid pairs of that satisfy our equation.
The maximum that can be is because must be an integer (this is because , an integer). Then , and we continue this downward until , in which case . The number of pairs of , and so is then .
See also
2000 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |