The bounds of Lemma 4 are <=, not <, as is this branch's condition.

diff --git a/src/runtime/arith.scm b/src/runtime/arith.scm
index b417b4843c210ba1a10c6783a70298ce8dd26776..a061722a53fb2601103bcade763116b7ef9ffb7a 100644 (file)
--- a/src/runtime/arith.scm
+++ b/src/runtime/arith.scm
@@ -2175,8 +2175,8 @@ USA.
          ;;
          ;; Since p = 2p/2 <= 1 <= 2*2p = 4p, the floating-point
          ;; evaluation of 1 - 2p is exact; the only error arises from
-         ;; division and log1p.  First, note that if logistic(-1) < p <
-         ;; logistic(+1), (1 - 2p)/p lies in the bounds of Lemma 4.
+         ;; division and log1p.  First, note that if logistic(-1) <= p
+         ;; <= logistic(+1), (1 - 2p)/p lies in the bounds of Lemma 4.
          ;;
          ;; If division has relative error d0 and log1p has relative
          ;; error d1, the outcome is