Maths Olympiad Prep

Library / /73 of 104

Algebra Difficulty 6.3 National Olympiad Prove it Bulgaria

Problem:
Let p(x)p(x) and q(x)q(x) be polynomials with m2m \geq 2 non-zero coefficients. If p(x)q(x)\frac{p(x)}{q(x)} is not a constant function, find the least possible number of the non-zero coefficients of the polynomial f(u,v)=p(u)q(v)p(v)q(u)f(u, v)=p(u) q(v)-p(v) q(u).

Solution

Solution:
Considering the polynomials p(x)=xm1+xm2++x+1p(x)=x^{m-1}+x^{m-2}+\cdots+x+1 and q(x)=xm1+xm2++x+aq(x)=x^{m-1}+x^{m-2}+\cdots+x+a, a1a \neq 1, shows that the desired minimal number does not exceed 2m22m-2 (one has that f(u,v)=(a1)(um1+um2++u)+(1a)(vm1+vm2++v)f(u, v)=(a-1)\left(u^{m-1}+u^{m-2}+\cdots+u\right)+(1-a)\left(v^{m-1}+v^{m-2}+\cdots+v\right)). We shall prove by induction on mm that the number of the non-zero coefficients is at least 2m22m-2.

If p(x)p(x) or q(x)q(x) contains a monomial which does not appear in the other polynomial, then the non-zero coefficients in f(u,v)f(u, v) are at least 2m2m. So we may assume that p(x)p(x) and q(x)q(x) contain the same monomials. Note also that multiplying some of p(x)p(x) and q(x)q(x) by a non-zero number does not change the non-zero coefficients of f(u,v)f(u, v).

For m=2m=2 one has that p(x)=axn+bxkp(x)=a x^{n}+b x^{k}, q(x)=cxn+dxkq(x)=c x^{n}+d x^{k} and adbc0ad-bc \neq 0. Then f(u,v)=(adbc)unvk+(bcad)ukvnf(u, v)=(ad-bc) u^{n} v^{k}+(bc-ad) u^{k} v^{n} has exactly two non-zero coefficients.

Let m=3m=3 and let p(x)=xk+axn+bxp(x)=x^{k}+a x^{n}+b x^{\ell}, q(x)=xk+cxn+dxq(x)=x^{k}+c x^{n}+d x^{\ell} and adbc0ad-bc \neq 0. Then
f(u,v)=(adbc)uvk+(bcad)uvn+(ca)ukvn+(ac)unvk+(db)ukv+(bd)uvk \begin{aligned} f(u, v)= & (ad-bc) u^{\ell} v^{k}+(bc-ad) u^{\ell} v^{n}+(c-a) u^{k} v^{n}+(a-c) u^{n} v^{k} \\ & +(d-b) u^{k} v^{\ell}+(b-d) u^{\ell} v^{k} \end{aligned}
The first two coefficients are non-zero. Since the equalities a=ca=c and b=db=d do not hold simultaneously, then at least two of the last four coefficients are also non-zero.

Let now m4m \geq 4 and let p(x)=p1(x)+axn+bxkp(x)=p_{1}(x)+a x^{n}+b x^{k}, q(x)=q1(x)+cxn+dxkq(x)=q_{1}(x)+c x^{n}+d x^{k}, adbc0ad-bc \neq 0 and any of the polynomials p1(x)p_{1}(x) and q1(x)q_{1}(x) has m22m-2 \geq 2 non-zero coefficients. Then f(u,v)=f1(u,v)+f2(u,v)+f3(u,v)f(u, v)=f_{1}(u, v)+f_{2}(u, v)+f_{3}(u, v), where
f1(u,v)=p1(u)q1(v)p1(v)q1(u)f2(u,v)=(aun+buk)q1(v)+(cvn+dvk)p1(u)(avn+bvk)q1(u)(cun+duk)p1(v)f3(u,v)=(adbc)unvk+(bcad)ukvn \begin{aligned} f_{1}(u, v)= & p_{1}(u) q_{1}(v)-p_{1}(v) q_{1}(u) \\ f_{2}(u, v)= & \left(a u^{n}+b u^{k}\right) q_{1}(v)+\left(c v^{n}+d v^{k}\right) p_{1}(u) \\ & -\left(a v^{n}+b v^{k}\right) q_{1}(u)-\left(c u^{n}+d u^{k}\right) p_{1}(v) \\ f_{3}(u, v)= & (ad-bc) u^{n} v^{k}+(bc-ad) u^{k} v^{n} \end{aligned}
and the different polynomials have no similar monomials. If p1(x)αq1(x)p_{1}(x) \neq \alpha q_{1}(x), then, by the induction hypothesis, f1(u,v)f_{1}(u, v) has at least 2(m2)2=2m62(m-2)-2=2m-6
non-zero coefficients. Moreover, f2(u,v)f_{2}(u, v) has at least two non-zero coefficients and f3(u,v)f_{3}(u, v) has two non-zero coefficients.

If p1(x)=αq1(x)p_{1}(x)=\alpha q_{1}(x), α0\alpha \neq 0, then
f2(u,v)=q1(v)[(acα)un+(bdα)uk]+q1(u)[(cαa)vn+(dαb)vk]f_{2}(u, v)=q_{1}(v)\left[(a-c\alpha) u^{n}+(b-d\alpha) u^{k}\right]+q_{1}(u)\left[(c\alpha-a) v^{n}+(d\alpha-b) v^{k}\right].
Since the equalities acα=0a-c\alpha=0 and bdα=0b-d\alpha=0 do not hold simultaneously, the polynomial f2(u,v)f_{2}(u, v) has at least 2m22m-2 non-zero coefficients (two times more than those of q1(x)q_{1}(x)). Counting the two non-zero coefficients of f3(u,v)f_{3}(u, v), we get the desired result.

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.