From 4d2e79e7eec793a557c26d1253bcfc13f6b555d6 Mon Sep 17 00:00:00 2001 From: Mattias Andrée Date: Mon, 25 Jul 2016 15:58:29 +0200 Subject: Style fix MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Mattias Andrée --- doc/exercises.tex | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/doc/exercises.tex b/doc/exercises.tex index 23b8ef4..e89c2b3 100644 --- a/doc/exercises.tex +++ b/doc/exercises.tex @@ -168,13 +168,13 @@ For improved performance, instead of using \texttt{zmod}, you can use the recursive function % \( \displaystyle{ - k ~\mbox{Mod}~ 2^n - 1 = + k \mod (2^n - 1) = \left ( - (k ~\mbox{Mod}~ 2^n) + \lfloor k \div 2^n \rfloor - \right ) ~\mbox{Mod}~ 2^n - 1, + (k \mod 2^n) + \lfloor k \div 2^n \rfloor + \right ) \mod (2^n - 1), }\) % -where $k ~\mbox{Mod}~ 2^n$ is efficiently calculated +where $k \mod 2^n$ is efficiently calculated using \texttt{zand($k$, $2^n - 1$)}. (This optimisation is not part of the difficulty rating of this problem.) -- cgit v1.2.3-70-g09d2