The unit group modulo n is cyclic exactly for n equal to 1, 2, 4, an odd prime power, or twice one. A small computation will anchor the general statement before the abstraction takes over.
The mathematical object
Congruences turn divisibility into arithmetic in \(\mathbf Z/n\mathbf Z\). The unit group \((\mathbf Z/n\mathbf Z)^\times\) controls which residues can be cancelled, inverted, or assigned a multiplicative order.
I keep the defining relation \(\mathsf D\) above the derived relation \(\mathsf C\). This exposes whether cancellation used \(x\ne0\) and whether the conclusion is canonical.
One explicit computation
The computation below is not a second theorem. It is a checksum for the definitions and a place to inspect the difficult LaTeX at full size.
Why the identity matters
The compact alignment is a local map of the argument: assumptions on the first row, consequence on the second. Any generalisation must preserve that dependency.
Where it can fail
Cancellation modulo \(n\) requires a unit. Dividing both sides by a zero divisor is one of the fastest ways to manufacture a false congruence.
A symbolic summary is trustworthy only because the example and limitation remain visible beside it. The box compresses the conclusion without hiding its origin.