Int Polynom
A theoretical unit on the algebra and number theory of polynomials over $\mathbb Z$, bordering into some algebraic number theory and Galois theory. Algebraic integers and irreducible polynomials feature prominently in this unit. The number theory in this unit goes deeper than that used in the Irreducible unit.
By the name, one's first guess about this unit is not far from the truth. Yes, the unit deals with integer polynomials, but in reality there is much more to it. Topics such as rings, fields, UFDs, are introduced, along with other concepts in algebraic number theory. Evan himself says the unit title is "a bit of a misnomer" and a better title would be "algebra of polynomials".
This unit is definitely on the harder side for a D unit; many of the problems are quite difficult. Some units you can do after this unit are Irreducible and Real Poly.
Notable Problems
-
HMIC 2014/4 9 clubber. Elegant example demonstrating the powerful techniques the unit covers.
-
2017 USA TST/6 Raw, difficult number theory problem near the end of the set. Good application of polynomials, despite being a pure NT problem.
-
2018 APMO/5 Polynomial functional equation with nice solution.
-
Hong Kong TST 19/14 Relatively easy problem, contains a cute application of the techniques from the lecture.