1 problem found
For any given positive integer \(n\), a number \(a\) (which may be complex) is said to be a primitive \(n\)th root of unity if \(a^n=1\) and there is no integer \(m\) such that \(0 < m < n\) and \(a^m = 1\). Write down the two primitive 4th roots of unity. Let \({\rm C}_n(x)\) be the polynomial such that the roots of the equation \({\rm C}_n(x)=0\) are the primitive \(n\)th roots of unity, the coefficient of the highest power of \(x\) is one and the equation has no repeated roots. Show that \({\rm C}_4(x) = x^2+1\,\).
Solution: The primitive 4th roots of unity are \(i\) and \(-i\). (Since the other two roots of \(x^4-1\) are also roots of \(x^2-1\) \({\rm C}_4(x) = (x-i)(x+i) = x^2+1\) as required.