If $p$ is a prime, $(\Bbb Z/p)^\times\simeq\Bbb Z/(p-1)$
Proof. Since $(\Bbb Z/p)^\times$ is abelian, $(\Bbb Z/p)^\times\simeq\prod_{i=1}^m\Bbb Z/n_i$ where $2\leq n_i\mid n_{i+1}$ for each $i$. Then for $a\in(\Bbb Z/p)^\times, a^{n_m}=1$ so the polynomial $x^{n_m}-1\in(\Bbb Z/p)[x]$ has at least $p-1 =|(\Bbb Z/p)^\times|$ many roots.
From this, I want to conclude $m=1$ so that $(\Bbb Z/p)^\times\simeq \Bbb Z/(p-1)$. Could you help?
Proof. If $(\Bbb Z/p)^\times$ is abelian, $(\Bbb Z/p)^\times\simeq \Bbb Z/p_1^{n_1}\times\cdots\times\Bbb Z/p_m^{n_m}$ and $p_i$ are distinct as if we let $k = \operatorname{lcm}(p_1,...,p_m)$, then $x^k =1$ for any $x\in (\Bbb Z/p)^\times$. If $p_i$ are not distinct, $|G|>k$ so the number of roots of $x^k-1$ has more element than $k$ elements.