Home > IMO, Problem Solving > Irreductible Polynomial TST 2003

Irreductible Polynomial TST 2003


Let f\in\mathbb{Z}[X] be an irreducible polynomial over the ring of integer polynomials, such that |f(0)| is not a perfect square. Prove that if the leading coefficient of f is 1 (the coefficient of the term having the highest degree in f) then f(X^2) is also irreducible in the ring of integer polynomials.

Mihai Piticari, Romanian TST 2003


Advertisements
Categories: IMO, Problem Solving Tags: ,
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: