Typos
This commit is contained in:
@ -103,7 +103,7 @@ Show that every element of $A$ is in \textit{exactly one} equivalence class\foot
|
||||
|
||||
We now have a proper definition of \say{mod $n$:} \par
|
||||
it is the equivalence relation $a \equiv_n b$, which is usually written as $a \equiv b \pmod{n}$. \par
|
||||
We will use this definition thoughout this handout.
|
||||
We will use this definition throughout this handout.
|
||||
|
||||
\note[Note]{
|
||||
This is different than the \say{mod} operator $a ~\%~ b $,
|
||||
|
Reference in New Issue
Block a user