Let x and y be positive integers such that x y x 2 + y 2 + 1 is an integer. Over all such pairs of integers ( x , y ) , how many distinct possible values of x y x 2 + y 2 + 1 are there?
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 k = x y x 2 + y 2 + 1 . For a given fixed k , let's consider all possible pairs ( x , y ) of positive integers that satisfy the equation k = x y x 2 + y 2 + 1 . Amongst all such pairs, let ( a , b ) be the pair which minimizes the sum a + b . (Such a solution must exist.) We will show that a = b .
Suppose not. Then without loss of generality, we have a > b . Consider the quadratic equation x b x 2 + b 2 + 1 = k ⇒ x 2 − k x b + b 2 + 1 = 0 . We already know that x 1 = a is a root, hence by Vieta's formulae, the other root satisfies x 2 = k b − a = a b 2 + 1 , which is an integer by the first equation. Also, since a > b ≥ 1 are positive integers, thus b 2 + 1 < a 2 ⇒ x 2 = a b 2 + 1 < a . Consider the pair ( x 2 , b ) . This satisfies x 2 b x 2 2 + b 2 + 1 = k and x 2 = a b 2 + 1 < a , which contradicts the minimality of a + b .
Hence, we must have a = b which means that a 2 2 a 2 + 1 is an integer, thus a 2 ∣ 1 ⇒ a = 1 . Hence, k = 1 1 + 1 + 1 = 3 is the only possible answer. Hence, there is 1 integer value of x y x 2 + y 2 + 1 .
Problem Loading...
Note Loading...
Set Loading...
Let x y x 2 + y 2 + 1 = t and consider all pair of positive integers ( x , y ) that satisfy the equation x y x 2 + y 2 + 1 = t Among all such pairs ( x , y ) , let ( a , b ) be pair such that a + b is minimum.
Claim a = b .
Proof: Assume a > b . Pay attention to this equation b x x 2 + b 2 + 1 = t which is equivalent to x 2 − b t x + b 2 + 1 = 0 a quadratic equation in x . We know that x 1 = a is the root of this equation. The other root can be found using Vieta's formula. That is x 2 = b t − a = a b 2 + 1 , so x 2 is positive integer. Since a > b ≥ 1 we have x 2 = a b 2 + 1 < a . So we get x 2 + b < a + b contradicting the minimality of a + b . Hence a = b , we proved our claim.
Since a = b we get t = a 2 2 a 2 + 1 hence a 2 divide 1 it means a = 1 = b so we get t = 3 . We conclude that 3 is the only possible value for x y x 2 + y 2 + 1 .