The totient function is multiplicative and removes one factor 1 minus 1 over p for every prime dividing n. A small computation will anchor the general statement before the abstraction takes over.
Set-up
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.
The formulas should not be merged too early. The datum \(\mathsf D\), the conclusion \(\mathsf C\), and the bridge \(\Longrightarrow\) have three different logical jobs.
The calculation
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
What survives abstraction
The formula is reusable precisely because it says which pieces are structural and which belong only to the worked example.
The boundary
Cancellation modulo \(n\) requires a unit. Dividing both sides by a zero divisor is one of the fastest ways to manufacture a false congruence.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.