Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2010/ia/paper-4/2e/a/solution

Write the rational number as with coprime integers and . Substituting into the monic polynomial and multiplying by gives
All terms except the first are divisible by , so . If , it has a prime factor dividing , and the Euclid lemma implies that this prime divides , contradicting coprimality. Thus , proving this special case of the rational root theorem:

New to topics? Read the docs here!