1. The problem statement, all variables and given/known data Give an example of a polynomial irreducible in Q[x], but reducible in Z[x] 2. Relevant equations 3. The attempt at a solution I think there is no example of this. The coefficients of a reducible polynomial with integer coefficients will be rational, or am I mistaken?