Alternative prooof:

From the discussion in section 4.2, we can infer that P(z) will have at least one complex solution.
Call it

Now we have to prove that

is a factor of P(z).
Assume

is not a factor of P(z).
From the division algorithm we have,

where R(z) is the remainder which must be non zero for all z because of our assumption.
Setting

in this identity

or

(

is a zero of

)which is a contradiction.
Hence,

is a factor of P(z) which means

Using the same argument we have,


.
.
.

where

is the solution of

.
Now

Now little thought reveals

is apolynomial of degree

Therefore

is a constant as it has degree n-n=0
On multiplying out the factors the coefficient of

is

.
Equating this coefficient with the one in original expression for P(z) we have

Hence,
