Mark/handouts
Mark/handouts
1
0
Fork 0
Code Pull Requests 2 Actions Packages Releases Activity

Typo

Browse Source
This commit is contained in:
Mark 2024-02-16 08:33:54 -08:00
parent e8eb1a783e
commit ec3cf3b27f
Signed by: Mark
GPG Key ID: C6D63995FE72FD80
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
Advanced/Cryptography/parts/challenge.tex
View File

@ -27,13 +27,13 @@ This means that we can \say{cancel} operations in groups, much like we do in alg
\problem{}
Let $G$ be the set of all bijections $A \to A$. \par
Let $\circ$ be the usual composition operator. \par
Is $(G, \circ)$ a group?
\vfill
Is $(G, \circ)$ a group?
\vfill
\definition{}
Note that our definition of a group does \textbf{not} state that $a \ast b = b \ast a$. \par
Many interesting groups do not have this property.
Those that do are called \textit{abelian} groups. \par
Those that do are called \textit{abelian} groups. \par
\vspace{2mm}
@ -179,5 +179,8 @@ $\gcd(ac + b, a) = \gcd(a, b)$ \par
\vfill
[Note on \ref{eua_runtime}] This proof can be used to show that the Euclidean algorithm finishes in logarithmic time, and it is the first practical application of the Fibonacci numbers. If you have finished all challenge problems, finish the proof: show that the Euclidean runs in $O(\log{n})$
[Note on \ref{eua_runtime}] This proof can be used to show that the Euclidean
algorithm finishes in logarithmic time, and it is the first practical application
of the Fibonacci numbers. If you have finished all challenge problems,
finish the proof: show that the Euclidean algorithm runs in $O(\log{n})$
\pagebreak