(wrong string) ée

From: <git_AT_suckless.org>
Date: Mon, 25 Jul 2016 01:13:40 +0200 (CEST)

commit 114cc6b1a25c8a40e5df7d8af965a127c784a8b7
Author: Mattias Andrée <maandree_AT_kth.se>
AuthorDate: Sun Jul 24 20:57:12 2016 +0200
Commit: Mattias Andrée <maandree_AT_kth.se>
CommitDate: Sun Jul 24 20:57:12 2016 +0200

    Fix typo
    
    Signed-off-by: Mattias Andrée <maandree_AT_kth.se>

diff --git a/doc/exercises.tex b/doc/exercises.tex
index 6afbead..e5397bb 100644
--- a/doc/exercises.tex
+++ b/doc/exercises.tex
_AT_@ -221,7 +221,7 @@ of times $n$ is divisible by 2. If we write $n$ on
 the form $1 \cdot 2 \cdot 3 \cdot \ldots \cdot x$,
 every $2^\text{nd}$ factor is divisible by 2, every
 $4^\text{th}$ factor is divisible by $2^2$, and so on.
-From call \texttt{zlsb} we know how many times,
+From calling \texttt{zlsb} we know how many times,
 $n$ is divisible by 2, but know how many of the factors
 are divisible by 2, but this can be calculated with
 the following algorithm, where $k$ is the number
Received on Mon Jul 25 2016 - 01:13:40 CEST