Difference between revisions of "2000 AIME I Problems/Problem 6"
(edit conflict again!) |
Talkinaway (talk | contribs) (→Solution) |
||
Line 8: | Line 8: | ||
y - 2\sqrt{xy} + x &=& 4\\ | y - 2\sqrt{xy} + x &=& 4\\ | ||
\sqrt{y} - \sqrt{x} &=& \pm 2\end{eqnarray*}</cmath> | \sqrt{y} - \sqrt{x} &=& \pm 2\end{eqnarray*}</cmath> | ||
+ | |||
+ | Because <math>y > x</math>, we only consider <math>+2</math>. | ||
For simplicity, we can count how many valid pairs of <math>(\sqrt{x},\sqrt{y})</math> that satisfy our equation. | For simplicity, we can count how many valid pairs of <math>(\sqrt{x},\sqrt{y})</math> that satisfy our equation. | ||
Line 15: | Line 17: | ||
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>. | 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]] | [[Category:Intermediate Algebra Problems]] |
Revision as of 09:32, 20 June 2011
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
Because , we only consider .
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 |