Difference between revisions of "2008 AIME II Problems/Problem 15"
(solutions by (1) riliu and (2) Altheman) |
I like pie (talk | contribs) |
||
Line 7: | Line 7: | ||
== Solution == | == Solution == | ||
=== Solution 1 === | === Solution 1 === | ||
− | Write <math>n^2 = (m + 1)^3 - m^3 = 3m^2 + 3m + 1</math>, or equivalently, | + | Write <math>n^2 = (m + 1)^3 - m^3 = 3m^2 + 3m + 1</math>, or equivalently, <math>(2n + 1)(2n - 1) = 4n^2 - 1 = 12m^2 + 12m + 3 = 3(2m + 1)^2</math>. |
− | |||
− | < | ||
Since <math>2n + 1</math> and <math>2n - 1</math> are both odd and their difference is <math>2</math>, they are [[relatively prime]]. But since their product is three times a square, one of them must be a square and the other three times a square. We cannot have <math>2n - 1</math> be three times a square, for then <math>2n + 1</math> would be a square congruent to <math>2</math> modulo <math>3</math>, which is impossible. | Since <math>2n + 1</math> and <math>2n - 1</math> are both odd and their difference is <math>2</math>, they are [[relatively prime]]. But since their product is three times a square, one of them must be a square and the other three times a square. We cannot have <math>2n - 1</math> be three times a square, for then <math>2n + 1</math> would be a square congruent to <math>2</math> modulo <math>3</math>, which is impossible. | ||
Line 15: | Line 13: | ||
Thus <math>2n - 1</math> is a square, say <math>b^2</math>. But <math>2n + 79</math> is also a square, say <math>a^2</math>. Then <math>(a + b)(a - b) = a^2 - b^2 = 80</math>. Since <math>a + b</math> and <math>a - b</math> have the same parity and their product is even, they are both even. To maximize <math>n</math>, it suffices to maximize <math>2b = (a + b) - (a - b)</math> and check that this yields an integral value for <math>m</math>. This occurs when <math>a + b = 40</math> and <math>a - b = 2</math>, that is, when <math>a = 21</math> and <math>b = 19</math>. This yields <math>n = 181</math> and <math>m = 104</math>, so the answer is <math>\boxed{181}</math>. | Thus <math>2n - 1</math> is a square, say <math>b^2</math>. But <math>2n + 79</math> is also a square, say <math>a^2</math>. Then <math>(a + b)(a - b) = a^2 - b^2 = 80</math>. Since <math>a + b</math> and <math>a - b</math> have the same parity and their product is even, they are both even. To maximize <math>n</math>, it suffices to maximize <math>2b = (a + b) - (a - b)</math> and check that this yields an integral value for <math>m</math>. This occurs when <math>a + b = 40</math> and <math>a - b = 2</math>, that is, when <math>a = 21</math> and <math>b = 19</math>. This yields <math>n = 181</math> and <math>m = 104</math>, so the answer is <math>\boxed{181}</math>. | ||
− | |||
=== Solution 2 === | === Solution 2 === | ||
Suppose that the consecutive squares are <math>m</math> and <math>m + 1</math>. We can use completing the square and the first condition to get: | Suppose that the consecutive squares are <math>m</math> and <math>m + 1</math>. We can use completing the square and the first condition to get: |
Revision as of 20:01, 17 April 2008
Problem
Find the largest integer satisfying the following conditions:
- (i)
can be expressed as the difference of two consecutive cubes;
- (ii)
is a perfect square.
Solution
Solution 1
Write , or equivalently,
.
Since and
are both odd and their difference is
, they are relatively prime. But since their product is three times a square, one of them must be a square and the other three times a square. We cannot have
be three times a square, for then
would be a square congruent to
modulo
, which is impossible.
Thus is a square, say
. But
is also a square, say
. Then
. Since
and
have the same parity and their product is even, they are both even. To maximize
, it suffices to maximize
and check that this yields an integral value for
. This occurs when
and
, that is, when
and
. This yields
and
, so the answer is
.
Solution 2
Suppose that the consecutive squares are and
. We can use completing the square and the first condition to get:
where
and
are non-negative integers. Now this is a pell equation, with solutions in the form
. However,
is even and
is odd. It is easy to see that the parity of
and
switch each time (by induction). Hence all solutions to the first condition are in the form:
where
. So we can (with very little effort) obtain the following:
. It is an AIME problem so it is implicit that
, so
. It is easy to see that
is strictly increasing by induction. Checking
in the second condition works (we know
is odd so we don't need to find
). So we're done.
See also
2008 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last problem | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |