- #1
Ray
- 25
- 0
Can anyone explain the idea behind Hadlock's proof that there is an Sn for every poly of degree n? Theorem 37 page 217
I can follow how to build up G from F using symmetric functions and the primitive element theorem. A lso I get the idea of constructing a poly of deg n! from one of deg n. But he starts with rationals beta1 etc to make G irreducible and I don't see the connection back down to F.
I can follow how to build up G from F using symmetric functions and the primitive element theorem. A lso I get the idea of constructing a poly of deg n! from one of deg n. But he starts with rationals beta1 etc to make G irreducible and I don't see the connection back down to F.