If you find any mistakes, please make a comment! Thank you.

## Use Lagrange’s Theorem to prove Euler’s Theorem

Solution to Abstract Algebra by Dummit & Foote 3rd edition Chapter 3.2 Exercise 3.2.22

Use Lagrange’s Theorem in the multiplicative group $G = (\mathbb{Z}/(n))^\times$ to prove Euler’s Theorem: if $\mathsf{gcd}(a,n) = 1$ then $a^{\varphi(n)} \equiv 1 \pmod n$. ($\varphi$ denotes the Euler totient function.)

Solution: If $\mathsf{gcd}(a,n) = 1$, then $\overline{a} \in \mathbb{Z}/(n)^\times$. By Lagrange’s Theorem, $|a|$ divides $|G| = \varphi(n)$. Thus $$a^{\varphi(n)} \equiv 1 \pmod n.$$

#### Linearity

This website is supposed to help you study Linear Algebras. Please only read these solutions after thinking about the problems carefully. Do not just copy these solutions.