diff options
| author | Mattias Andrée <maandree@kth.se> | 2016-07-24 20:57:12 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@kth.se> | 2016-07-24 20:57:12 +0200 |
| commit | 114cc6b1a25c8a40e5df7d8af965a127c784a8b7 (patch) | |
| tree | a5762fdeb69525fc682889a1eac798e0476c5147 | |
| parent | Saturated subtraction: { => r = }a ∸ b = ..... (diff) | |
| download | libzahl-114cc6b1a25c8a40e5df7d8af965a127c784a8b7.tar.gz libzahl-114cc6b1a25c8a40e5df7d8af965a127c784a8b7.tar.bz2 libzahl-114cc6b1a25c8a40e5df7d8af965a127c784a8b7.tar.xz | |
Fix typo
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to '')
| -rw-r--r-- | doc/exercises.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/exercises.tex b/doc/exercises.tex index 6afbead..e5397bb 100644 --- a/doc/exercises.tex +++ b/doc/exercises.tex @@ -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 |