PsychonautQQ said:
My bad, I should have said x^n - 1 splits in Q(c). x^n-1 is divided by the minimal polynomial of Q(c)? The minimal polynomial of Q(c) will not b the nth cyclotomic polynomial because n is not primitive, do I need to know more about it's minimal polynomial. But the nth cyclotomic polynomial will be a factor of the minimal polynomial in c because all of it's roots are powers of c.
Well the ##n-##th roots of unity are all complex numbers, because at latest ##x^n-1## splits in ##\mathbb{C}##.
You know, that they divide the unit circle in equidistant parts. Since ##1^n-1=0\, , \,(x-1)\,|\,(x^n-1)## and our first point is ##1##. The others are therefore ##\exp(\frac{k}{n}\,\cdot\,2\pi\,i)=\exp(\frac{1}{n}\,\cdot\,2\pi\,i)^k=c^k## with ##k=1,\ldots,n-1##. Split. You know from previous posts, that you need a primitive root ##c## as given to get all others as a power of it.
I'm not sure how you define the cyclotomic polynomial. In my books, it
is the (irreducible) minimal polynomial (which of course has to divide ##x^n-1##).
We don't say ##n## is primitive or not. A root of ##x^n-1## can be primitive or not: ##\exp(\frac{1}{n}\,\cdot\,2\pi\,i)^1## is, ##\exp(\frac{1}{n}\,\cdot\,2\pi\,i)^0## is not. ##c## is primitive simply means, that you can hop around the circle starting at ##c^0## by steps of ##\cdot c## and hit all other roots before you hit one twice. Like ##(c^0,c^3,c^2,c^1)## hops in steps of ##c^3## and hits all of the ##4-##th roots of unity, whereas ##(c^0,c^2)## in steps of ##c^2## does not.