Olympiad Maths Prep

Track / Stage 5 / 237 of 400 #837 of 2000

Problem 837

AIME late
Algebra Difficulty 5.5 Prove it

Show that for any natural number n>1n>1 the polynomial Pn=x4n+3+x4n+1+x4n2+x8P_{n}=x^{4 n+3}+x^{4 n+1}+x^{4 n-2}+x^{8} is divisible by x2+1x^{2}+1

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

We apply the previous proposition to the number i. The polynomial x2+1x^{2}+1 is annihilated by i. x2+1x^{2}+1 has no real roots, so it has no rational roots either. Thus x2+1x^{2}+1 is irreducible. Since μix2+1,μi=x2+1\mu_{i} \mid x^{2}+1, \mu_{i}=x^{2}+1. Since i4=i^{4}= we have Pn(i)=P_{n}(i)= i3+i1+i2+i4=i+i1+1=0\mathfrak{i}^{3}+\mathfrak{i}^{1}+\mathfrak{i}^{2}+\mathfrak{i}^{4}=-\mathfrak{i}+\mathfrak{i}-1+1=0. Since PnP_{n} is annihilated by ii, it is divisible by Ö mui=x2+1m \mathfrak{u}_{i}=x^{2}+1.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.