[Gmp-commit] /var/hg/gmp: Mark Jacobi algorithm description as obsolete.

[mercurial at gmplib.org]

details:   /var/hg/gmp/rev/500ec6f20185
changeset: 15209:500ec6f20185
user:      Torbjorn Granlund <tege at gmplib.org>
date:      Sat Dec 22 21:19:18 2012 +0100
description:
Mark Jacobi algorithm description as obsolete.

diffstat:

 doc/gmp.texi |  5 ++++-
 1 files changed, 4 insertions(+), 1 deletions(-)

diffs (22 lines):

diff -r d0e55ed7605c -r 500ec6f20185 doc/gmp.texi
--- a/doc/gmp.texi	Fri Dec 21 15:56:16 2012 +0100
+++ b/doc/gmp.texi	Sat Dec 22 21:19:18 2012 +0100
@@ -8614,6 +8614,9 @@
 @subsection Jacobi Symbol
 @cindex Jacobi symbol algorithm
 
+[This section is obsolete.  The current Jacobi code actually uses a very
+efficient algorithm.]
+
 @code{mpz_jacobi} and @code{mpz_kronecker} are currently implemented with a
 simple binary algorithm similar to that described for the GCDs (@pxref{Binary
 GCD}).  They're not very fast when both inputs are large.  Lehmer's multi-step
@@ -8660,7 +8663,7 @@
 made to minimize the average number of multiplications that must supplement
 the squaring.
 
-The modular multiplies and squares use either a simple division or the REDC
+The modular multiplies and squarings use either a simple division or the REDC
 method by Montgomery (@pxref{References}).  REDC is a little faster,
 essentially saving N single limb divisions in a fashion similar to an exact
 remainder (@pxref{Exact Remainder}).