Difference between revisions of "2015 OIM Problems/Problem 5"
(→See also) |
(solution) |
||
Line 7: | Line 7: | ||
== Solution == | == Solution == | ||
− | {{ | + | First we deal with the zero cases. Assume that <math>a=0</math>; then the right-hand side (RHS) is zero, so we must have <math>b^2-7b=0</math>; therefore our solutions are <math>(0,0)</math> and <math>(0,7)</math>. These both clearly work. Next assume that <math>b=0</math>; then the RHS is also zero, so <math>7a=0</math> and thus <math>a=0</math>, which we already considered. |
+ | |||
+ | Next, we consider nonzero <math>a,b</math>. We can rewrite the RHS as <math>a^2\cdot ab</math>; then <math>ab</math> must then be a perfect square, so let <math>ab=k^2</math> for some integer <math>k</math>. Then the equation becomes: | ||
+ | <cmath>(b^2+7(a-b))^2=a^2k^2</cmath> | ||
+ | <cmath>b^2+7(a-b)=ak</cmath> | ||
+ | (Both positive and negative cases are already considered since <math>k</math> can be either positive or negative.) | ||
+ | |||
+ | Our equation can be rearranged to become: | ||
+ | <cmath>b(b-7)=a(k-7)</cmath> | ||
+ | Multiplying both sides by <math>b</math>: | ||
+ | <cmath>b^2(b-7)=ab(k-7)=k^2(k-7)</cmath> | ||
+ | This can be rearranged to produce: | ||
+ | <cmath>b^3-k^3=7(b^2-k^2)</cmath> | ||
+ | Assume that <math>b=k</math>. Then <math>b^2=ab</math>, and since <math>b</math> is nonzero, we must have <math>a=b</math>. All such solutions work in the equation. | ||
+ | |||
+ | Next, assume that <math>b\ne k</math>. Then we can divide <math>(b-k)</math> from both sides: | ||
+ | <cmath>(b-k)(b^2+bk+k^2)=7(b+k)(b-k)</cmath> | ||
+ | <cmath>b^2+bk+k^2=7b+7k</cmath> | ||
+ | <cmath>b^2+(k-7)b+(k^2-7k)=0</cmath> | ||
+ | Using the [[Quadratic Formula]]: | ||
+ | <cmath>b=\frac{-k+7\pm\sqrt{(k-7)^2-4(k^2-7k)}}{2}=\frac{-k+7\pm\sqrt{-3k^2+14k+49}}{2}=\frac{-k+7\pm\sqrt{(3k+7)(7-k)}}{2}</cmath> | ||
+ | Consider the discriminant. We must have <math>(3k+7)(7-k)\ge0</math>, so we have to consider integers <math>k\in[-2,7]</math>. From casework we derive that <math>k=-2,3,6,7</math> all cause the discriminant to be a perfect square, respectively <math>9,64,25,0</math>. Solving the equation yields the pairs | ||
+ | <cmath>k=-2,b=3,6</cmath> | ||
+ | <cmath>k=3,b=-2,6</cmath> | ||
+ | <cmath>k=6,b=-2,3</cmath> | ||
+ | <cmath>k=7,b=0</cmath> | ||
+ | <math>b\ne0</math>, so we can eliminate the final pair. Otherwise, since <math>k^2=ab</math>, we must have that <math>b|k^2</math>. This leaves | ||
+ | <cmath>k=6,b=-2,3</cmath> | ||
+ | as the only possibility. From here we find that <math>a=-18,12</math> respectively, so our pairs are <math>(-18,-2)</math> and <math>(12,3)</math>, which both work. | ||
+ | |||
+ | Notice that <math>(0,0)</math> is a member of the set of points <math>a=b</math>, so to sum up, the solutions to the equation are <math>\boxed{(0,7),(-18,-2),(12,3),(t,t)}</math> for integers <math>t</math>. | ||
+ | |||
+ | ~ [https://artofproblemsolving.com/wiki/index.php/User:Eevee9406 eevee9406] | ||
== See also == | == See also == | ||
[[OIM Problems and Solutions]] | [[OIM Problems and Solutions]] |
Latest revision as of 18:10, 8 April 2025
Problem
Find all pairs of integers that verify:
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
First we deal with the zero cases. Assume that ; then the right-hand side (RHS) is zero, so we must have
; therefore our solutions are
and
. These both clearly work. Next assume that
; then the RHS is also zero, so
and thus
, which we already considered.
Next, we consider nonzero . We can rewrite the RHS as
; then
must then be a perfect square, so let
for some integer
. Then the equation becomes:
(Both positive and negative cases are already considered since
can be either positive or negative.)
Our equation can be rearranged to become:
Multiplying both sides by
:
This can be rearranged to produce:
Assume that
. Then
, and since
is nonzero, we must have
. All such solutions work in the equation.
Next, assume that . Then we can divide
from both sides:
Using the Quadratic Formula:
Consider the discriminant. We must have
, so we have to consider integers
. From casework we derive that
all cause the discriminant to be a perfect square, respectively
. Solving the equation yields the pairs
, so we can eliminate the final pair. Otherwise, since
, we must have that
. This leaves
as the only possibility. From here we find that
respectively, so our pairs are
and
, which both work.
Notice that is a member of the set of points
, so to sum up, the solutions to the equation are
for integers
.