2. Let be a polynomial of degree 2, at least one of whose coefficients is not an integer. Suppose that for every integer , the number is also an integer. Prove that the polynomial has only integer coefficients.
Problem 1290
Official solution
III/2. Let . Then the numbers and must be integers. Let , so . If is even, the number is an integer, so the number must also be an integer, which is in contradiction with the assumption of the problem, since all coefficients of the polynomial are integers. Therefore, must be odd, i.e., of the form . Thus, . From this, it follows that must also be of the form . Therefore, , so the polynomial has only integer coefficients.
2nd method. Let . Then the numbers and must be integers. Thus, we know that
. If we add and subtract the last two numbers, we find that the numbers and must also be integers. If is an even number, is an integer. Since , is also an integer - the condition of the problem is therefore not met. Thus, must be an odd number. By a similar argument, we find that must also be an odd number.
Thus, we can write and . We substitute these into the polynomial and get . All its coefficients are indeed integers.
Conclusion ..... 1 point
Conclusion ..... 1 point
Conclusion or ..... 1 point
Use of the assumption and conclusion that two coefficients are not integers ..... 1 point
Conclusion that is of the form for some ..... 1 point
Conclusion that is of the form for some ..... 1 point
Final conclusion that the coefficients of the polynomial are integers ..... 1 point
The last point is awarded only for completely irrefutable reasoning throughout the ENTIRE solution. If the contestant assumes from the start that the coefficients are rational numbers (and immediately writes the coefficients in the form ), the conclusions drawn by this method are NOT RECOGNIZED.