by Wolstenholme, Nov 27, 2014, 4:13 AM

OK so the key here is going to be the identity
We proceed with induction on

The base case of

is trivial since we can let

and
Now note that if
![$ p, q \in \mathbb{Z}[x] $](//latex.artofproblemsolving.com/1/0/5/1053525d3a52d418051242a05e6b4449523afffe.png)
such that

we have
Now since for any
-th root of unity

we have

we are done by induction.
To find this I basically just played with

and

and

and it took about 15 minutes.

Ugh I solved this on the TSTST and I really don't want to do it again since the solution I had was awful. Basically by letting the coefficients of

and

be variables where

and expanding the LHS and setting the coefficient of every term with degree greater than

to

you get a system with more variables than equations so there exists a nontrivial solution.

WLOG assume

Assume for the sake of contradiction that

Let

and let

be the number of distinct roots of

and let

be the number of distinct roots of
First note that

and

share no roots in common. Therefore

has every distinct root of

and of

as a root. This implies that
Now note that

shares at least

roots with

and at least

roots with

Therefore

which implies that

contradiction.
This post has been edited 1 time. Last edited by Wolstenholme, Nov 27, 2014, 4:14 AM