NETMaths

Is this true?

A polynomial irreducible over is irreducible modulo some prime

No — it is false.

The counterexample

Irreducible over , yet reducible modulo every prime.

The kind of mistake this is

Base field or ring

The answer changes with the field or ring you are working over.

Drill statements like this

Others that fail the same way

From Rings and FieldsPolynomial rings and irreducibility tests

ShareWhatsAppTelegram