Maths Olympiad Prep

Library / /1388 of 1394

, 2024

Algebra Difficulty 6.4 National Olympiad Prove it United States

Problem:

A polynomial fZ[x]f \in \mathbb{Z}[x] is called splitty if and only if for every prime pp, there exist polynomials gp,hpZ[x]g_p, h_p \in \mathbb{Z}[x] with deggp,deghp<degf\operatorname{deg} g_p, \operatorname{deg} h_p < \operatorname{deg} f and all coefficients of fgphpf - g_p h_p are divisible by pp. Compute the sum of all positive integers n100n \leq 100 such that the polynomial x4+16x2+nx^4 + 16 x^2 + n is splitty.

Proposed by: Pitchayut Saengrungkongka

Solution

Solution:

We claim that x4+ax2+bx^4 + a x^2 + b is splitty if and only if either bb or a24ba^2 - 4b is a perfect square. (The latter means that the polynomial splits into (x2r)(x2s)(x^2 - r)(x^2 - s).)

Assuming the characterization, one can easily extract the answer. For a=16a = 16 and b=nb = n, one of nn and 64n64 - n has to be a perfect square. The solutions to this that are at most 6464 form 88 pairs that sum to 6464 (if we include 00), and then we additionally have 8181 and 100100. This means the sum is 648+81+100=69364 \cdot 8 + 81 + 100 = 693.

Now, we move on to prove the characterization.

## Necessity.

Take a prime pp such that neither a24ba^2 - 4b nor bb is a quadratic residue modulo pp (exists by Dirichlet + CRT + QR). Work in Fp\mathbb{F}_p. Now, suppose that

x4+ax2+b=(x2+mx+n)(x2+sx+t) x^4 + a x^2 + b = (x^2 + m x + n)(x^2 + s x + t)

Then, looking at the x3x^3-coefficient gives m+s=0m + s = 0 or s=ms = -m. Looking at the xx-coefficient gives m(nt)=0m(n - t) = 0.

- If m=0m = 0, then s=0s = 0, so x4+ax2+b=(x2+n)(x2+t)x^4 + a x^2 + b = (x^2 + n)(x^2 + t), which means a24b=(n+t)24nt=(nt)2a^2 - 4b = (n + t)^2 - 4 n t = (n - t)^2, a quadratic residue modulo pp, contradiction.
- If n=tn = t, then b=ntb = n t is a square modulo pp, a contradiction. (The major surprise of this problem is that this suffices, which will be shown below.)

## Sufficiency.

Clearly, the polynomial splits in p=2p = 2 because in F2[x]\mathbb{F}_2[x], we have x4+ax2+b=(x2+ax+b)2x^4 + a x^2 + b = (x^2 + a x + b)^2. Now, assume pp is odd.

If a24ba^2 - 4b is a perfect square, then x4+ax2+bx^4 + a x^2 + b splits into (x2r)(x2s)(x^2 - r)(x^2 - s) even in Z[x]\mathbb{Z}[x].

If bb is a perfect square, then let b=k2b = k^2. We then note that

- x4+ax2+bx^4 + a x^2 + b splits in form (x2r)(x2s)(x^2 - r)(x^2 - s) if (a24k2p)=1\left(\frac{a^2 - 4k^2}{p}\right) = 1.
- x4+ax2+bx^4 + a x^2 + b splits in form (x2+rx+k)(x2rx+k)(x^2 + r x + k)(x^2 - r x + k) if a=2kr2a = 2k - r^2, or (2kap)=1\left(\frac{2k - a}{p}\right) = 1.
- x4+ax2+bx^4 + a x^2 + b splits in form (x2+rxk)(x2rxk)(x^2 + r x - k)(x^2 - r x - k) if a=2kr2a = -2k - r^2, or (2kap)=1\left(\frac{-2k - a}{p}\right) = 1.

Since (2ka)(2ka)=a24k2(2k - a)(-2k - a) = a^2 - 4k^2, it follows that at least one of these must happen.

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.