NETMaths

Is this true?

In every integral domain, irreducible implies prime

No — it is false.

The counterexample

2 in

2 is irreducible (no element of norm 2) but divides without dividing either factor.

The kind of mistake this is

Standard counterexample

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

Drill statements like this

Others that fail the same way

From Rings and FieldsEuclidean, PID, UFD hierarchy

ShareWhatsAppTelegram