about summary refs log tree commit diff
path: root/README.libm
diff options
context:
space:
mode:
authorJakub Jelinek <jakub@redhat.com>2007-07-12 18:26:36 +0000
committerJakub Jelinek <jakub@redhat.com>2007-07-12 18:26:36 +0000
commit0ecb606cb6cf65de1d9fc8a919bceb4be476c602 (patch)
tree2ea1f8305970753e4a657acb2ccc15ca3eec8e2c /README.libm
parent7d58530341304d403a6626d7f7a1913165fe2f32 (diff)
downloadglibc-0ecb606cb6cf65de1d9fc8a919bceb4be476c602.tar.gz
glibc-0ecb606cb6cf65de1d9fc8a919bceb4be476c602.tar.xz
glibc-0ecb606cb6cf65de1d9fc8a919bceb4be476c602.zip
2.5-18.1
Diffstat (limited to 'README.libm')
-rw-r--r--README.libm2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.libm b/README.libm
index 33ace8c065..f058cf846c 100644
--- a/README.libm
+++ b/README.libm
@@ -486,7 +486,7 @@ sqrt
  *   Bit by bit method using integer arithmetic. (Slow, but portable)
  *   1. Normalization
  *	Scale x to y in [1,4) with even powers of 2:
- *	find an integer k such that  1 <= (y=x*2^(2k)) < 4, then
+ *	find an integer k such that  1 <= (y=x*2^(-2k)) < 4, then
  *		sqrt(x) = 2^k * sqrt(y)
  *   2. Bit by bit computation
  *	Let q  = sqrt(y) truncated to i bit after binary point (q = 1),