Edits to group theory handout

Advanced/Group Theory/parts/03 bonus.tex

@@ -1,8 +1,8 @@
 \section{Bonus}
 
 \problem{}
-Find the inverse of 19 in $\mathbb{Z}/23$ \\
-\hint{Recall the Euclidian Algorithm}
+Find the inverse of 19 in $\mathbb{Z}_{23}$ \\
+\hint{Recall the Euclidean Algorithm}
 
 
 \begin{solution}
@@ -17,9 +17,12 @@ $$
 	a^p = a \text{ (mod p)}
 $$
 
+For positive integers $a, p$
+
 \vfill
 
 \problem{}
+Let $a$ and $m$ be integers so that $a < m$. \\
 Show that $a$ has an inverse mod $m$ iff $\gcd(a, m) = 1$ \\
 
 \begin{solution}