 |
Fix spacing - libzahl - big integer library |
 |
git clone git://git.suckless.org/libzahl |
 |
Log |
|
Files |
|
Refs |
|
README |
|
LICENSE |
|
--- |
|
commit 2864613b162ed4c7a28a79c8c4dcd24893cc2128 |
|
parent d11d27b4b13788a4172f46d19c40395fcca865c2 |
|
Author: Mattias Andrée <[email protected]> |
|
Date: Thu, 28 Jul 2016 15:05:18 +0200 |
|
|
|
Fix spacing |
|
|
|
Signed-off-by: Mattias Andrée <[email protected]> |
|
|
|
Diffstat: |
|
M doc/exercises.tex | 6 +++--- |
|
|
|
1 file changed, 3 insertions(+), 3 deletions(-) |
|
--- |
|
diff --git a/doc/exercises.tex b/doc/exercises.tex |
|
@@ -179,10 +179,10 @@ For improved performance, instead of using \texttt{zmod}, |
|
you can use the recursive function |
|
% |
|
\( \displaystyle{ |
|
- k \mod (2^n - 1) = |
|
+ k \text{ mod } (2^n - 1) = |
|
\left ( |
|
- (k \mod 2^n) + \lfloor k \div 2^n \rfloor |
|
- \right ) \mod (2^n - 1), |
|
+ (k \text{ mod } 2^n) + \lfloor k \div 2^n \rfloor |
|
+ \right ) \text{ mod } (2^n - 1), |
|
}\) |
|
% |
|
where $k \mod 2^n$ is efficiently calculated |
