* mpz/millerrabin.c: Mark for internal use only, for now.

	* gmp.texi (Number Theoretic Functions): Remove documentation.

1 files changed, 9 insertions, 11 deletions

diff --git a/gmp.texi b/gmp.texi
index 5e6f9a2b2..e0ffb6d00 100644
--- a/gmp.texi
+++ b/gmp.texi
@@ -2757,22 +2757,20 @@ be perfect squares.
 @cindex Number theoretic functions
 
 @deftypefun int mpz_probab_prime_p (mpz_t @var{n}, int @var{reps})
-@deftypefunx int mpz_millerrabin (mpz_t @var{n}, int @var{reps})
 @cindex Prime testing functions
-Determine whether @var{n} is a prime.  Return 2 if @var{n} is definitely
-prime, return 1 if @var{n} is probably prime (without being certain), or
-return 0 if @var{n} is definitely composite.
+Determine whether @var{n} is prime.  Return 2 if @var{n} is definitely prime,
+return 1 if @var{n} is probably prime (without being certain), or return 0 if
+@var{n} is definitely composite.
 
-@code{mpz_probab_prime_p} does some trial divisions then calls
-@code{mpz_millerrabin}.  @code{mpz_millerrabin} uses Miller-Rabin
-probabilistic primality tests.  @var{reps} controls how many such tests are
-performed, 5 to 10 is a reasonable number, more will reduce the chances of a
-composite being returned as ``probably prime''.
+This function does some trial divisions, then some Miller-Rabin probabilistic
+primality tests.  @var{reps} controls how many such tests are done, 5 to 10 is
+a reasonable number, more will reduce the chances of a composite being
+returned as ``probably prime''.
 
 Miller-Rabin and similar tests can be more properly called compositeness
 tests.  Numbers which fail are known to be composite but those which pass
-might be prime or might be composite.  Only a few composites pass, hence
-numbers which pass are considered probably prime.
+might be prime or might be composite.  Only a few composites pass, hence those
+which pass are considered probably prime.
 @end deftypefun
 
 @deftypefun void mpz_nextprime (mpz_t @var{rop}, mpz_t @var{op})