NETMaths

Is this true?

A group of order pq (p < q) is always cyclic

No — it is false.

The counterexample

of order 6 = 2·3

Non-abelian because 2 | 3 − 1. The cyclic conclusion needs p ∤ q − 1.

The kind of mistake this is

Execution slip

The idea was right. The computation was not.

Drill statements like this

Others that fail the same way

From GroupsSylow theorems and groups of small order

ShareWhatsAppTelegram