Counterexample

Is this true?

Irreducible over $\mathbb{Z} \Rightarrow$ irreducible mod every prime

No — it is false.

The counterexample

The object that kills this claim comes with Trap Analysis.

86 counterexamples are free — including most of the ones Part C leans on hardest.

Keep practicing

Standard counterexample

There is a canonical object that settles this. Recognising it is the whole question.

See real exam options built on this mistake Drill statements like this

polynomials fields

Go deeper· Explained in full in Irreducibility tests· Asked in CSIR NET June 2025· From Rings and Fields › Polynomial rings and irreducibility tests

ShareWhatsApp Telegram