How would I go about proving:
For every non-prime $n \in \mathbb N$ there exists $m \in \mathbb Z / n\mathbb Z \setminus \{0\}$ with $m^{n-1} \not\equiv 1 \mod n$.
I already proved the other way around (straight forward using Euler-Fermat), but am stuck at this point.
Pick $m$ a nontrivial divisor of $n$, and let $k:=n/m$. Suppose that $m^{n-1}\equiv 1(\mod n)$. Then $k\equiv k\cdot 1\equiv km^{n-1}\equiv nm^{n-2}\equiv 0(\mod n)$, contradiction, since $0<k<n$.