aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
Diffstat (limited to '')
-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}$.