# [Python-checkins] Fix typos in comment (GH-21966)

Raymond Hettinger webhook-mailer at python.org
Wed Aug 26 16:10:09 EDT 2020

```https://github.com/python/cpython/commit/82e79480d6e61940d7007d9026fbff0b1a11ad9a
branch: master
author: Raymond Hettinger <rhettinger at users.noreply.github.com>
committer: GitHub <noreply at github.com>
date: 2020-08-26T13:09:40-07:00
summary:

Fix typos in comment (GH-21966)

files:
M Modules/mathmodule.c

diff --git a/Modules/mathmodule.c b/Modules/mathmodule.c
index 1d6174132814b..1704d8efd31c3 100644
--- a/Modules/mathmodule.c
+++ b/Modules/mathmodule.c
@@ -2440,7 +2440,7 @@ addend should be in the range: 0.5 <= |x| <= 1.0.  Accordingly,
scaling or division by *max* should not be skipped even if not
otherwise needed to prevent overflow or loss of precision.

-The assertion that hi*hi >= 1.0 is a bit subtle.  Each vector element
+The assertion that hi*hi <= 1.0 is a bit subtle.  Each vector element
gets scaled to a magnitude below 1.0.  The Veltkamp-Dekker splitting
algorithm gives a *hi* value that is correctly rounded to half
precision.  When a value at or below 1.0 is correctly rounded, it
@@ -2458,7 +2458,7 @@ The correction is the first order term of the Maclaurin series
expansion of sqrt(h**2 + x) == h + x/(2*h) + O(x**2).

Essentially, this differential correction is equivalent to one
-refinement step in the Newton divide-and-average square root
+refinement step in Newton's divide-and-average square root
algorithm, effectively doubling the number of accurate bits.
This technique is used in Dekker's SQRT2 algorithm and again in
Borges' ALGORITHM 4 and 5.

```