Difference between revisions of "2003 AIME II Problems/Problem 10"
m |
Dgreenb801 (talk | contribs) |
||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| − | {{ | + | Call the two integers <math>b</math> and <math>b+60</math>, so we have <math>\sqrt{b}+\sqrt{b+60}=\sqrt{c}</math>. Square both sides to get <math>2b+60+2\sqrt{b^2+60b}=c</math>. Thus, <math>b^2+60b</math> must be a square, so we have <math>b^2+60b=n^2</math>, and <math>(b+n+30)(b-n+30)=900</math>. The sum of these two factors is <math>2b+60</math>, so they must both be even. To maximize <math>b</math>, we want to maximixe <math>b+n+30</math>, so we let it equal 450 and the other factor 2, but solving gives <math>b=196</math>, which is already a perfect square, so we have to keep going. In order to keep both factors even, we let the larger one equal 150 and the other 6, which gives <math>b=48</math>. This checks, so the solution is 48+108=156. |
== See also == | == See also == | ||
{{AIME box|year=2003|n=II|num-b=9|num-a=11}} | {{AIME box|year=2003|n=II|num-b=9|num-a=11}} | ||
Revision as of 20:56, 18 February 2008
Problem
Two positive integers differ by 
The sum of their square roots is the square root of an integer that is not a perfect square. What is the maximum possible sum of the two integers?
Solution
Call the two integers 
and 
, so we have 
. Square both sides to get 
. Thus, 
must be a square, so we have 
, and 
. The sum of these two factors is 
, so they must both be even. To maximize , we want to maximixe 
, so we let it equal 450 and the other factor 2, but solving gives 
, which is already a perfect square, so we have to keep going. In order to keep both factors even, we let the larger one equal 150 and the other 6, which gives 
. This checks, so the solution is 48+108=156.
See also
| 2003 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Problem 11 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
