Integer Less One divides Power Less One/Corollary/Converse

Converse of Corollary to Integer Less One divides Power Less One
Let $m, n, q \in \Z_{>0}$.

Let
 * $\left({q^m - 1}\right) \mathop \backslash \left({q^n - 1}\right)$

where $\backslash$ denotes divisibility.

Then:
 * $m \mathop \backslash n$

Proof
By the Division Theorem:
 * $\exists a, b \in \Z: n = m a + b, 0 \le b < m$

Then:
 * $q^n \equiv q^{m a} q^b \equiv q^b \equiv 1 \pmod \left({q^m - 1}\right)$

But:
 * $q^b - 1 < q^m - 1$

So:
 * $q^b - 1 = 0$

and so $b = 0$.

Hence the result.