Typos
This commit is contained in:
@ -36,7 +36,7 @@ Using the two theorems above, detail an algorithm for finding $\gcd(a, b)$. \par
|
||||
Then, compute $\gcd(1610, 207)$ by hand. \par
|
||||
|
||||
\begin{solution}
|
||||
Using \ref{gcd_abc} and the division algorthm,
|
||||
Using \ref{gcd_abc} and the division algorithm,
|
||||
|
||||
% Minipage prevents column breaks inside body
|
||||
\begin{multicols}{2}
|
||||
|
@ -16,7 +16,7 @@ This is the \textit{discrete logarithm problem}, often abbreviated \textit{DLP}.
|
||||
\problem{}
|
||||
Does the discrete log function even exist? \par
|
||||
Show that $\exp$ is a bijection, which will guarantee the existence of $\log$. \par
|
||||
\note[Note]{Why does this guarantee the existence of log? Recall our lesson on funtions.}
|
||||
\note[Note]{Why does this guarantee the existence of log? Recall our lesson on functions.}
|
||||
|
||||
\vfill
|
||||
|
||||
|
Reference in New Issue
Block a user