Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2009/ii/paper-4/18h/b/solution

A primitive tenth root has and , so division of by gives
It is irreducible over : replacing by gives , and then replacing by gives . Any nontrivial monic integer factorization would reduce modulo five to factors that are powers of , forcing both constant terms divisible by five and their product divisible by , contrary to the constant term five. Rational factorization reduces to integer factorization by Gauss lemma: products of primitive integer polynomials are primitive, since reduction modulo any prime preserves a nonzero product. Thus
Let . Dividing by gives . Hence , so . Either sign of this square root suffices; for the positive one is .

New to topics? Read the docs here!