Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2003/iii/paper-36/3/solution
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 36 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A root of unity over a finite field is an element satisfying , with ; the algebraic closure is essential because all roots need not lie in the base field. Write and , where . In characteristic ,The latter polynomial has distinct roots, since the derivative is nonzero at every root. Those roots are closed under multiplication and inversion and contain , so is a finite multiplicative subgroup of a field. The proof in the preceding solution makes it a cyclic group. In particularThis also explains why the coprimality qualification is needed.
The multiplicative group of a finite field is cyclic of order . It contains the entire group of th roots precisely when . For necessity, a generator of has order and Lagrange's theorem applies. For sufficiency, a cyclic group whose order is divisible by contains roots of ; since there are exactly roots in the algebraic closure, these are all of them. Hence the least positive extension degree isHere is the multiplicative order of the residue class of modulo . If is coprime to , replace by . Existence of this order follows because is a unit modulo .
A primitive th root of unity over a finite field has multiplicative order exactly . If , no such element exists, since all roots have order dividing . If , choose a generator of . The element has order , so it is primitive precisely when . Therefore there are primitive roots, with the Euler totient function.
If is primitive of order , then exactly when , equivalently . The implication from that equality to membership follows because the roots of form , as proved in the preceding solution. Consequentlyfor , and the degree is one for . This is also the length of the finite-field Frobenius automorphism orbit of .
New to topics? Read the docs here!