 |
Fix typo - libzahl - big integer library |
 |
git clone git://git.suckless.org/libzahl |
 |
Log |
|
Files |
|
Refs |
|
README |
|
LICENSE |
|
--- |
|
commit 7e8ea5ca2505686932b489e0aa1df0b3f0433e19 |
|
parent 157c52efce3fce61af6d411584c7ce35e371be07 |
|
Author: Mattias Andrée <[email protected]> |
|
Date: Sat, 30 Jul 2016 00:04:21 +0200 |
|
|
|
Fix typo |
|
|
|
Signed-off-by: Mattias Andrée <[email protected]> |
|
|
|
Diffstat: |
|
M doc/exercises.tex | 2 +- |
|
|
|
1 file changed, 1 insertion(+), 1 deletion(-) |
|
--- |
|
diff --git a/doc/exercises.tex b/doc/exercises.tex |
|
@@ -284,7 +284,7 @@ Implement the function |
|
\noindent |
|
which calculates $r = {}^n{}b \text{ mod } m$, where |
|
${}^0{}b = 1$, ${}^1{}b = b$, ${}^2{}b = b^b$, |
|
-${}^3{}b = b^{b^b}$, ${}^b{}b = b^{b^{b^b}}$, and so on. |
|
+${}^3{}b = b^{b^b}$, ${}^4{}b = b^{b^{b^b}}$, and so on. |
|
You can assume $b > 0$ and $m > 0$. You can also assume |
|
\texttt{r}, \texttt{b}, and \texttt{m} are mutually |
|
unique pointers. |
