aboutsummaryrefslogtreecommitdiffstats
path: root/doc
diff options
context:
space:
mode:
authorMattias Andrée <maandree@kth.se>2016-07-28 20:24:46 +0200
committerMattias Andrée <maandree@kth.se>2016-07-28 20:24:46 +0200
commitdd753f78b0c39d86a4cccca08996df303762e532 (patch)
tree452960696289d0e347e3786de4312c11fe32b525 /doc
parentAdd exercises: (diff)
downloadlibzahl-dd753f78b0c39d86a4cccca08996df303762e532.tar.gz
libzahl-dd753f78b0c39d86a4cccca08996df303762e532.tar.bz2
libzahl-dd753f78b0c39d86a4cccca08996df303762e532.tar.xz
Fix small error in solution for [13] The totient
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to 'doc')
-rw-r--r--doc/exercises.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/exercises.tex b/doc/exercises.tex
index 4af53e9..ebf8e91 100644
--- a/doc/exercises.tex
+++ b/doc/exercises.tex
@@ -668,7 +668,7 @@ of \texttt{b} with its absolute value.
\noindent
So, if we set $a = n$ and $b = 1$, then we iterate
-of all integers $p$, $2 \le p < n$. For which $p$
+of all integers $p$, $2 \le p \le n$. For which $p$
that is prime, we set $a \gets a \cdot (p - 1)$ and
$b \gets b \cdot p$. After the iteration, $b | a$,
and $\varphi(n) = \frac{a}{b}$.