IMC 2006, Day 1, Problem 4
Let be a rational function (i.e. the quotient of two real polynomials) and suppose that is an integer for infinitely many integers . Prove that is a polynomial.
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. Let be an infinite set of integers such that rational function is integral for all .
Suppose that where is a polynomial of degree and is a polynomial of degree . Then are solutions to the simultaneous equations for all that are not roots of . These are linear simultaneous equations in the coefficients of with rational coefficients. Since they have a solution, they have a rational solution.
Thus there are polynomials with rational coefficients such that for all that are not roots of . Multiplying this with the previous equation, we see that for all that are not roots of . If is not a root of or , then , and hence for all except for finitely many roots of and . Thus the two polynomials and are equal for infinitely many choices of value. Thus . Dividing by , we see that . Thus can be written as the quotient of two polynomials with rational coefficients. Multiplying up by some integer, it can be written as the quotient of two polynomials with integer coefficients.
Suppose where and both have integer coefficients. Then by Euler's division algorithm for polynomials, there exist polynomials and , both of which have rational coefficients such that and the degree of is less than the degree of . Dividing by , we get that . Now there exists an integer such that has integral coefficients. Then is an integer for all . However, this is equal to the rational function , which has a higher degree denominator than numerator, so tends to 0 as tends to . Thus for all sufficiently large , and hence . Thus has infinitely many roots, and is 0. Thus , so is a polynomial.
Transcribed from the official solutions, page 2. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.