Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-oxford/2017/prelims/mathematics-iv/7/a/ii/solution

Let and . Applying polynomial long division gives the euclidean algorithm
Thus their polynomial greatest common divisor is , up to a nonzero constant factor. Their unique common root of a polynomial is therefore

New to topics? Read the docs here!