Maths Olympiad Prep

Library / Canadian Mathematical Olympiad /35 of 57

Canadian Mathematical Olympiad

Algebra Difficulty 6.8 National Olympiad Prove it Canada

Problem:
A polynomial cdxd+cd−1xd−1+⋯+c1x+c0c_{d}x^{d} + c_{d - 1}x^{d - 1} + \dots + c_{1}x + c_{0} with degree dd is reflexive if there is an integer n≥dn \geq d such that ci=cn−ic_{i} = c_{n - i} for every 0≤i≤n0 \leq i \leq n, where ci=0c_{i} = 0 for i>di > d. Let ℓ≥2\ell \geq 2 be an integer and p(x)p(x) be a polynomial with integer coefficients. Prove that there exist reflexive polynomials q(x),r(x)q(x), r(x) with integer coefficients such that
(1+x+x2+⋯+xℓ−1)p(x)=q(x)+xℓr(x).(1 + x + x^{2} + \dots + x^{\ell -1})p(x) = q(x) + x^{\ell}r(x).

Solutions — 2

Solution 1

Solution:
Let dd be the degree of pp and let kk be any non-negative integer. We will choose
q(x)=xd+k+ℓp(1x)−p(x)x−1,q(x) = \frac{x^{d + k + \ell}p\left(\frac{1}{x}\right) - p(x)}{x - 1},
r(x)=p(x)−xd+kp(1x)x−1.r(x) = \frac{p(x) - x^{d + k}p\left(\frac{1}{x}\right)}{x - 1}.
First, we must show that both qq and rr are integer polynomials. Consider the numerator in qq's definition, xd+k+ℓp(1x)−p(x)x^{d + k + \ell}p\left(\frac{1}{x}\right) - p(x). This is clearly an integer polynomial. As it is equal to 00 when evaluated at x=1x = 1, x−1x - 1 divides it. Furthermore, as x−1x - 1 is monic, the quotient has integer coefficients. The argument for rr is similar.
Next, we will show that this choice of qq and rr satisfies the desired equation. Plugging them into the RHS of the equation gives
q(x)+xℓr(x)=xd+k+ℓp(1x)−p(x)x−1+xℓ(p(x)−xd+kp(1x)x−1)q(x) + x^{\ell}r(x) = \frac{x^{d + k + \ell}p\left(\frac{1}{x}\right) - p(x)}{x - 1} + x^{\ell}\left(\frac{p(x) - x^{d + k}p\left(\frac{1}{x}\right)}{x - 1}\right)
=xd+k+ℓp(1x)−p(x)+xℓp(x)−xd+k+ℓp(1x)x−1\qquad = \frac{x^{d + k + \ell}p\left(\frac{1}{x}\right) - p(x) + x^{\ell}p(x) - x^{d + k + \ell}p\left(\frac{1}{x}\right)}{x - 1}
=(xℓ−1x−1)p(x)\qquad = \left(\frac{x^{\ell} - 1}{x - 1}\right)p(x)
=(1+x+⋯+xℓ−1)p(x)\qquad = (1 + x + \cdots + x^{\ell -1})p(x)
as desired.
Finally, we will show that qq and rr are indeed reflexive. We can re-interpret the reflexive condition as such:
Polynomial a(x)a(x) is reflexive iff there is an integer n≥deg⁡(a)n \geq \deg (a) for which
a(x)=xna(1x).a(x) = x^{n}a\left(\frac{1}{x}\right).
We have
q(x)=xd+k+ℓp(1x)−p(x)x−1q(x) = \frac{x^{d + k + \ell}p\left(\frac{1}{x}\right) - p(x)}{x - 1}
=xd+k+ℓ−1⋅p(1x)−x−(d+k+ℓ)p(x)x−1x\qquad = x^{d + k + \ell -1}\cdot \frac{p\left(\frac{1}{x}\right) - x^{-(d + k + \ell)}p(x)}{\frac{x - 1}{x}}
=xd+k+ℓ−1⋅x−(d+k+ℓ)p(x)−p(1x)1x−1\qquad = x^{d + k + \ell -1}\cdot \frac{x^{-(d + k + \ell)}p(x) - p\left(\frac{1}{x}\right)}{\frac{1}{x} - 1}
=xd+k+ℓ−1q(1x)\qquad = x^{d + k + \ell -1}q\left(\frac{1}{x}\right)
as desired. Similarly,
r(x)=p(x)−xd+kp(1x)x−1r(x) = \frac{p(x) - x^{d + k}p\left(\frac{1}{x}\right)}{x - 1}
=xd+k−1⋅x−(d+k)p(x)−p(1x)x−1x\qquad = x^{d + k - 1}\cdot \frac{x^{-(d + k)}p(x) - p\left(\frac{1}{x}\right)}{\frac{x - 1}{x}}
=xd+k−1⋅p(1x)−x−(d+k)p(x)1x−1\qquad = x^{d + k - 1}\cdot \frac{p\left(\frac{1}{x}\right) - x^{-(d + k)}p(x)}{\frac{1}{x} - 1}
=xd+k−1r(1x).\qquad = x^{d + k - 1}r\left(\frac{1}{x}\right).

Solution 2

Solution:
We write degree nn polynomial pp as
p(x):=∑i=0npixi.p(x):= \sum_{i = 0}^{n}p_{i}x^{i}.
Define vector P∈Zn+1P\in \mathbb{Z}^{n + 1} as
P:=(p0 p1 … pn)T.P:= \left(p_{0}\ p_{1}\ \dots\ p_{n}\right)^{T}.
We also denote X∈Z[x]NX\in \mathbb{Z}[x]^{N} for NN some sufficiently high degree (e.g. N>2n+ℓN > 2n + \ell) as the vector of powers of xx, i.e.
X:=(1 x x2… xN−1)T.X:= \left(1\ x\ x^{2}\dots\ x^{N - 1}\right)^{T}.
For a matrix M∈Z(n+1)×NM\in \mathbb{Z}^{(n + 1)\times N}, PTMXP^{T}M X is an integer polynomial of degree <N< N. Note that if the non-zero entries of matrix MM are horizontally symmetric, then the resulting polynomial must be reflexive.

Then their total is the matrix whose entries are 11 at the parallelogram formed by
(0,0),(0,ℓ−1),(n,n+ℓ−1),(n,n),(0,0),(0,\ell -1),(n,n + \ell -1),(n,n),
which is precisely AA.

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

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