2015 OIM Problems/Problem 5
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
.