Maths Olympiad Prep

Library / /378 of 520

Algebra Difficulty 5.9 AIME, harder Find the answer

Example 9 Let p,qp, q be distinct primes, and let n3n \geqslant 3 be a positive integer. Find all integers aa such that the polynomial f(x)=xn+axn1+pqf(x)=x^{n}+a x^{n-1}+p q can be factored into the product of two polynomials with positive degrees and integer coefficients.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Analysis Note that p,qp, q are different primes, and use the divisibility of the coefficients of the polynomial terms to determine the degrees and coefficients of the two positive-degree integer-coefficient polynomials that the polynomial f(x)f(x) decomposes into.

Solution Let f(x)=g(x)h(x)f(x)=g(x) \cdot h(x), where g(x)g(x) and h(x)h(x) are positive-degree integer-coefficient polynomials. Since f(x)f(x) is an integer-coefficient polynomial with a leading coefficient of 1, the leading coefficients of g(x)g(x) and h(x)h(x) are also 1. Without loss of generality, let g(x)=xr+ar1xr1++a0,h(x)=xs+bs1xs1++b0g(x)=x^{r}+a_{r-1} x^{r-1}+\cdots+a_{0}, h(x)=x^{s}+b_{s-1} x^{s-1}+\cdots+b_{0}, where r,s1r, s \geqslant 1 and r+s=nr+s=n, a0,a1,,ar1,b0,b1,,bs1a_{0}, a_{1}, \cdots, a_{r-1}, b_{0}, b_{1}, \cdots, b_{s-1} are integers. Thus, a0b0=pqa_{0} b_{0}=p q, so pp divides a0a_{0} or b0b_{0}, but not both. Without loss of generality, assume pb0p \nmid b_{0}, then pa0p \mid a_{0}.
Assume pa0,,pat1,patp\left|a_{0}, \cdots, p\right| a_{t-1}, p \nmid a_{t}, then the coefficient of the tt-th term in g(x)h(x)g(x) \cdot h(x) is
atb0+at1b1++a1bt1+a0btatb0≢0(modp). a_{t} b_{0}+a_{t-1} b_{1}+\cdots+a_{1} b_{t-1}+a_{0} b_{t} \equiv a_{t} b_{0} \not \equiv 0(\bmod p) .

Notice that the coefficients of the terms with degree less than n1n-1 in f(x)f(x) are all multiples of pp. Therefore, tn1t \geqslant n-1. So rtn1r \geqslant t \geqslant n-1.
Thus, from r+s=nr+s=n and r,s1r, s \geqslant 1, we get r=n1,s=1r=n-1, s=1. Therefore, h(x)=x+b0,pb0h(x)=x+b_{0}, p \nmid b_{0}.
On the other hand, qa0b0q \mid a_{0} b_{0}. If qb0q \mid b_{0}, then similarly we can prove s=n1s=n-1. Thus n=2n=2, which contradicts n3n \geqslant 3. Therefore, qb0q \nmid b_{0}. Since b0pqb_{0} \mid p q, we have b0=±1b_{0}= \pm 1, so h(x)=x±1h(x)=x \pm 1.

If b0=1b_{0}=1, then h(x)=x+1h(x)=x+1, so f(1)=0f(-1)=0, i.e., (1)n+a(1)n+pq=0(-1)^{n}+a \cdot(-1)^{n}+p q=0, thus a=(1)npq+1a=(-1)^{n} p q+1.
If b0=1b_{0}=-1, then h(x)=x1h(x)=x-1, so f(1)=0f(1)=0, i.e., 1+a+pq=01+a+p q=0, thus a=pq1a=-p q-1.
It is easy to verify that when a=(1)npq+1a=(-1)^{n} p q+1 or a=pq1a=-p q-1, f(x)f(x) can be decomposed into the product of two positive-degree integer-coefficient polynomials. Therefore, the values of aa are (1)npq+1(-1)^{n} p q+1 or pq1-p q-1.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.