big integer library
git clone git://
Log | Files | Refs | README | LICENSE

commit 114cc6b1a25c8a40e5df7d8af965a127c784a8b7
parent 33bae5e5a2a36f6269d6953dfe2267720325d31c
Author: Mattias Andrée <>
Date:   Sun, 24 Jul 2016 20:57:12 +0200

Fix typo

Signed-off-by: Mattias Andrée <>

doc/exercises.tex | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git 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