Maths Olympiad Prep

Library / /365 of 462

, 2014

Algebra Difficulty 6.7 National Olympiad Prove it Ireland

a. Let a0a_0, a1a_1, a2a_2 be real numbers and consider the polynomial
P(x)=a0+a1x+a2x2. P(x) = a_0 + a_1 x + a_2 x^2.
Assume that P(1)P(-1), P(0)P(0) and P(1)P(1) are integers.
Prove that P(n)P(n) is an integer for all integers nn.

b. Let a0a_0, a1a_1, a2a_2, a3a_3 be real numbers and consider the polynomial
Q(x)=a0+a1x+a2x2+a3x3. Q(x) = a_0 + a_1 x + a_2 x^2 + a_3 x^3.
Assume that there exists an integer ii such that Q(i)Q(i), Q(i+1)Q(i+1), Q(i+2)Q(i+2) and Q(i+3)Q(i+3) are integers.
Prove that Q(n)Q(n) is an integer for all integers nn.

Solution

a. By assumption P(0)=a0ZP(0) = a_0 \in \mathbb{Z}, P(1)=a0a1+a2ZP(-1) = a_0 - a_1 + a_2 \in \mathbb{Z} and P(1)=a0+a1+a2ZP(1) = a_0 + a_1 + a_2 \in \mathbb{Z}. This implies that a1+a2a_1 + a_2 and a2a1a_2 - a_1 are integers, hence also 2a12a_1 and 2a22a_2. From P(n)=a0+a1n+a2n2=a0+a1(n+n2)+(a2a1)n2P(n) = a_0 + a_1 n + a_2 n^2 = a_0 + a_1(n + n^2) + (a_2 - a_1)n^2 we see now that P(n)ZP(n) \in \mathbb{Z}, as n+n2=n(n+1)n + n^2 = n(n + 1) is always even.

b. For integers k0k \ge 0 we define polynomials QkQ_k as follows:
Q0(x)=Q(x)andQk+1(x)=Qk(x+1)Qk(x) Q_0(x) = Q(x) \quad \text{and} \quad Q_{k+1}(x) = Q_k(x+1) - Q_k(x)
for all k0k \ge 0. Because for any polynomial ff, the leading terms of f(x+1)f(x+1) and f(x)f(x) coincide, it follows that the degree of Qk+1Q_{k+1} is smaller than the degree of QkQ_k. As Q0Q_0 was of degree three, it follows that Q3Q_3 is a constant. The polynomials Q1Q_1, Q2Q_2, Q3Q_3 can easily be determined, but their explicit form is not needed below.
The assumption that Q(i)Q(i), Q(i+1)Q(i+1), Q(i+2)Q(i+2) and Q(i+3)Q(i+3) are integers implies that Q1(i)Q_1(i), Q1(i+1)Q_1(i+1) and Q1(i+2)Q_1(i+2) are integers. In turn we get that Q2(i)Q_2(i) and Q2(i+1)Q_2(i+1) are integers, which finally yields that Q3(i)ZQ_3(i) \in \mathbb{Z}. As Q3Q_3 is constant, this shows that Q3(n)ZQ_3(n) \in \mathbb{Z} for all nZn \in \mathbb{Z}.
We show next that Qk+1(n)ZQ_{k+1}(n) \in \mathbb{Z} for all nZn \in \mathbb{Z} implies that Qk(n)ZQ_k(n) \in \mathbb{Z} for all nZn \in \mathbb{Z}, provided that Qk(i)ZQ_k(i) \in \mathbb{Z} for at least one iZi \in \mathbb{Z}. For nin \ge i this follows by induction from the equation Qk(n+1)=Qk+1(n)+Qk(n)Q_k(n+1) = Q_{k+1}(n) + Q_k(n). For nin \le i we use induction and the equality Qk(n1)=Qk(n)Qk+1(n1)Q_k(n-1) = Q_k(n) - Q_{k+1}(n-1).
Because we have seen that Q3(n)ZQ_3(n) \in \mathbb{Z} and that Q2(i)Q_2(i), Q1(i)Q_1(i) and Q0(i)Q_0(i) are integers, it follows now that Q0(n)Q_0(n) is an integer for all nZn \in \mathbb{Z}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.