Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2006 / Problems / Day 1, P4

IMC 2006 · Day 1 · P4

very hard
polynomialsworth 20 pts

Let ff be a rational function (i.e. the quotient of two real polynomials) and suppose that f(n)f(n) is an integer for infinitely many integers nn. Prove that ff is a polynomial.

Solution (official)

Let SS be an infinite set of integers such that rational function f(x)f(x) is integral for all xSx \in S. Suppose that f(x)=p(x)/q(x)f(x) = p(x)/q(x) where pp is a polynomial of degree kk and qq is a polynomial of degree nn. Then p,qp, q are solutions to the simultaneous equations p(x)=q(x)f(x)p(x) = q(x) f(x) for all xSx \in S that are not roots of qq. These are linear simultaneous equations in the coefficients of p,qp, q with rational coefficients. Since they have a solution, they have a rational solution.

Thus there are polynomials p,qp', q' with rational coefficients such that p(x)=q(x)f(x)p'(x) = q'(x) f(x) for all xSx \in S that are not roots of qq. Multiplying this with the previous equation, we see that p(x)q(x)f(x)=p(x)q(x)f(x)p'(x) q(x) f(x) = p(x) q'(x) f(x) for all xSx \in S that are not roots of qq. If xx is not a root of pp or qq, then f(x)0f(x) \ne 0, and hence p(x)q(x)=p(x)q(x)p'(x) q(x) = p(x) q'(x) for all xSx \in S except for finitely many roots of pp and qq. Thus the two polynomials pqp' q and pqp q' are equal for infinitely many choices of value. Thus p(x)q(x)=p(x)q(x)p'(x) q(x) = p(x) q'(x). Dividing by q(x)q(x)q(x) q'(x), we see that p(x)/q(x)=p(x)/q(x)=f(x)p'(x)/q'(x) = p(x)/q(x) = f(x). Thus f(x)f(x) 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 f(x)=p(x)/q(x)f(x) = p''(x)/q''(x) where pp'' and qq'' both have integer coefficients. Then by Euler's division algorithm for polynomials, there exist polynomials ss and rr, both of which have rational coefficients such that p(x)=q(x)s(x)+r(x)p''(x) = q''(x) s(x) + r(x) and the degree of rr is less than the degree of qq''. Dividing by q(x)q''(x), we get that f(x)=s(x)+r(x)/q(x)f(x) = s(x) + r(x)/q''(x). Now there exists an integer NN such that Ns(x)N s(x) has integral coefficients. Then Nf(x)Ns(x)N f(x) - N s(x) is an integer for all xSx \in S. However, this is equal to the rational function Nr/qN r / q'', which has a higher degree denominator than numerator, so tends to 0 as xx tends to \infty. Thus for all sufficiently large xSx \in S, Nf(x)Ns(x)=0N f(x) - N s(x) = 0 and hence r(x)=0r(x) = 0. Thus rr has infinitely many roots, and is 0. Thus f(x)=s(x)f(x) = s(x), so ff is a polynomial.

How the field did

contestants scored
237
average (of 20)
3.38
solved (≥ 80%)
9.3%
near-0 (≤ 10%)
69.2%
discrimination
0.42

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2018 · Day 2 · P9very hardavg 1.3/10 · solved 9% · near-0 80% · disc 0.52
IMC 2003 · Day 1 · P6very hardavg 1.6/10 · solved 8% · near-0 74% · disc 0.44
IMC 2001 · Day 2 · P7very hardavg 2.3/10 · solved 12% · near-0 57% · disc 0.23
IMC 2020 · Day 1 · P4very hardavg 0.7/10 · solved 6% · near-0 92% · disc 0.34