Let and be positive integers such that divides . Then, find the value of .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let x y x 2 + y 2 + 1 = k . Let, Among all pairs ( x , y ) which satisfy the above equation let ( X , Y ) be the solution which minimizes the sum x + y . As the system is symmetrical, WLOG let X > Y .
Now, Consider the equation t Y t 2 + Y 2 + 1 = k .
Then,
t 2 − k Y t + Y 2 + 1 = 0 is a quadratic in t . We know that t 1 = X is a solution to this quadratic.
So, by vieta's roots, the other root is t 2 = k Y − X = X Y 2 + 1
But t 2 is also an integer. Also, X > Y ≥ 1 .
So, t 2 = X Y 2 + 1 < X
So, t 2 + Y < X + Y , which contradicts the minimality of X + Y .
So, our assumption that X > Y is false. So, X = Y and thus X 2 ∣ 2 X 2 + 1 .
And this forces that X = 1 . And thus k = 3 .