Solution:
We claim that x4+ax2+b is splitty if and only if either b or a2−4b is a perfect square. (The latter means that the polynomial splits into (x2−r)(x2−s).)
Assuming the characterization, one can easily extract the answer. For a=16 and b=n, one of n and 64−n has to be a perfect square. The solutions to this that are at most 64 form 8 pairs that sum to 64 (if we include 0), and then we additionally have 81 and 100. This means the sum is 64⋅8+81+100=693.
Now, we move on to prove the characterization.
## Necessity.
Take a prime p such that neither a2−4b nor b is a quadratic residue modulo p (exists by Dirichlet + CRT + QR). Work in Fp. Now, suppose that
x4+ax2+b=(x2+mx+n)(x2+sx+t)
Then, looking at the x3-coefficient gives m+s=0 or s=−m. Looking at the x-coefficient gives m(n−t)=0.
- If m=0, then s=0, so x4+ax2+b=(x2+n)(x2+t), which means a2−4b=(n+t)2−4nt=(n−t)2, a quadratic residue modulo p, contradiction.
- If n=t, then b=nt is a square modulo p, a contradiction. (The major surprise of this problem is that this suffices, which will be shown below.)
## Sufficiency.
Clearly, the polynomial splits in p=2 because in F2[x], we have x4+ax2+b=(x2+ax+b)2. Now, assume p is odd.
If a2−4b is a perfect square, then x4+ax2+b splits into (x2−r)(x2−s) even in Z[x].
If b is a perfect square, then let b=k2. We then note that
- x4+ax2+b splits in form (x2−r)(x2−s) if (pa2−4k2)=1.
- x4+ax2+b splits in form (x2+rx+k)(x2−rx+k) if a=2k−r2, or (p2k−a)=1.
- x4+ax2+b splits in form (x2+rx−k)(x2−rx−k) if a=−2k−r2, or (p−2k−a)=1.
Since (2k−a)(−2k−a)=a2−4k2, it follows that at least one of these must happen.