An increasingly common question in more advanced High School Maths exams and beyond is being asked to prove/show that there are NO integer roots of a given polynomial. A lot of students do very poorly in these questions, because they have never faced the question-type before and hence are completely flummoxed as to how to proceed.
Fear not, for in this video we examine four such questions, answering two by the most common method (proof by contradiction) and the other two by a mixture of modular maths, contradiction and the polynomial factor theorem.

For the video 'Introduction to Proofs by Contradiction' mentioned in this video, see the link [ Ссылка ]

For more videos on proofs see our playlist "Proofs" at [ Ссылка ]

Join the Gresty Academy YouTube channel to get access to perks:
[ Ссылка ]

свернуть