Olympiad problems

1993 IMO Shortlist, 7

Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$

2010 N.N. Mihăileanu Individual, 2

If at least one of the integers $ a,b $ is not divisible by $ 3, $ then the polynom $ X^2-abX+a^2+b^2 $ is irreducible over the integers. [i]Ion Cucurezeanu[/i]

irreducibility irreducible polynomial polynomial algebra modular arithmetic number theory polynomials

1993 IMO, 1

Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$

irreducible factoring polynomials irreducible polynomial polynomial algebra factorization mathematical induction modular arithmetic polynomials