commit 183bfa766f29b3eb46b01c7b6e82d71d822b02d5
Author: Mattias Andrée <[email protected]>
AuthorDate: Fri Oct 21 05:25:03 2016 +0200
Commit: Mattias Andrée <[email protected]>
CommitDate: Fri Oct 21 05:25:03 2016 +0200
manual: fix truncated sentence
Signed-off-by: Mattias Andrée <[email protected]>
diff --git a/doc/exercises.tex b/doc/exercises.tex
index 0dcab4b..3a9df19 100644
--- a/doc/exercises.tex
+++ b/doc/exercises.tex
@@ -286,9 +286,9 @@ Implement the function
which calculates the totient $t = \varphi(n)$, where
$n = \displaystyle{\prod_{i = 1}^n P_i^{K_i}} > 0$,
and $P_i = \texttt{P[i - 1]} \in \textbf{P}$,
-$K_i = \texttt{K[i - 1]} \ge 1$. All values \texttt{P}.
-\texttt{P} and \texttt{K} make up the prime factorisation
-of $n$.
+$K_i = \texttt{K[i - 1]} \ge 1$. All values \texttt{P}
+are mutually unique. \texttt{P} and \texttt{K} make up
+the prime factorisation of $n$.
You can use the following rules:
