A quadratic trinomial with integer coefficients and is said to be *irrational* if it has irrational roots and .
Find the smallest value of the sum among all irrational trinomials.
, 2012
Solution
Answer: .
By condition, the trinomial has the roots, so its discriminant . Since and and are integer, we have and because the square of the integer number is congruent neither to 2 nor to 3 modulo 4.
Moreover, the trinomial has the roots
If the trinomial is irrational, but and are irrational numbers if and only if is different from the square of some integer number. Thus, in particular, and . Therefore, .
Since the roots and of the irrational trinomial are different from 0, there are only two possibilities:
1)
2)
For case 1) we have (the Vieta theorem). So . From (*) it follows that . Since , we have , i.e. . Thus, for case 1).
For case 2) from (*) it follows that .
It suffices to show that the estimate is admissible.
We find all irrational trinomials with the discriminants . By Vieta's theorem, if and only if , i.e. case 2) holds if and only if . If , then only if , but if , then . Therefore, there exist exactly two irrational trinomials with and : and .
Therefore, the smallest value of the sum of the modules of the roots of the irrational trinomial is equal to .