From 3f72c1abf956a911cab088a8f3be753dd601f3e3 Mon Sep 17 00:00:00 2001
From: Jonathan Wakely <cxx@kayari.org>
Date: Thu, 8 Oct 2020 10:17:43 +0100
Subject: [PATCH] [rand.eng.sub] drop no-op modulo operation

The e() mod 2^32 operation is a no-op, because e.max() < 2^32.
---
 source/numerics.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/source/numerics.tex b/source/numerics.tex
index 61f5b1094c..817c1ca5d5 100644
--- a/source/numerics.tex
+++ b/source/numerics.tex
@@ -3419,7 +3419,7 @@
  Then, to set each $X_k$,
  obtain new values $z_0, \dotsc, z_{n-1}$
  from $n = \lceil w/32 \rceil$ successive invocations
- of \tcode{e} taken modulo $2^{32}$.
+ of \tcode{e}.
  Set $X_k$ to $\left( \sum_{j=0}^{n-1} z_j \cdot 2^{32j}\right) \bmod m$.
 
 \pnum