## Irreductible Polynomial TST 2003

Let be an irreducible polynomial over the ring of integer polynomials, such that is not a perfect square. Prove that if the leading coefficient of is 1 (the coefficient of the term having the highest degree in ) then is also irreducible in the ring of integer polynomials.

*Mihai Piticari, Romanian TST 2003*

Advertisements

Categories: IMO, Problem Solving
irreductible, TST

Comments (0)
Trackbacks (0)
Leave a comment
Trackback