Import Debian changes 2d2-1debian/2d2-1

slib (2d2-1) unstable; urgency=low

  * New upstream version
  * Revert back to free.  Is now so.

slib (2d1-1) unstable; urgency=low

  * New upstream version.
  * Move to non-free.  FSF pointed out license doesn't allow modified
    versions to be distributed.
  * Get a complete list of copyrights that apply to the source into
    copyright file.
  * Remove setup for guile 1.3.
  * Remove postrm.  Just calling install-info (lintian)  Move install-info
    call to prerm since doc-base doesn't do install-info.

slib (2c9-3) unstable; urgency=low

  * Change info location to section "The Algorithmic Language Scheme" to
    match up with where guile puts it's files.
  * Postinst is running slibconfig now.  (Closes: #75891)

slib (2c9-2) unstable; urgency=low

  * Stop installing slibconfig (for guile).
  * In postinst if /usr/sbin/slibconnfig exists call it (Close: #75843
    #75891).

slib (2c9-1) unstable; urgency=low

  * New upstream (Closes: #74760)
  * replace string-index with strsrch:string-index in http-cgi.scm.
  * Add doc-base support (Closes: #31163)

1 files changed, 26 insertions, 43 deletions

diff --git a/factor.txi b/factor.txi
index 8277c2b..38c0dd1 100644
--- a/factor.txi
+++ b/factor.txi
@@ -1,73 +1,56 @@
 
-
-
 @defvar prime:prngs
 
- @var{prime:prngs} is the random-state (@pxref{Random Numbers}) used by these
- procedures.  If you call these procedures from more than one thread
- (or from interrupt), @code{random} may complain about reentrant
- calls.
+@var{prime:prngs} is the random-state (@pxref{Random Numbers}) used by these
+procedures.  If you call these procedures from more than one thread
+(or from interrupt), @code{random} may complain about reentrant
+calls.
 @end defvar
+@emph{Note:} The prime test and generation procedures implement (or
+use) the Solovay-Strassen primality test. See
 
-
-
-
+@itemize @bullet
+@item Robert Solovay and Volker Strassen,
+@cite{A Fast Monte-Carlo Test for Primality},
+SIAM Journal on Computing, 1977, pp 84-85.
+@end itemize
 
 
 @defun jacobi-symbol p q
 
- Returns the value (+1, @minus{}1, or 0) of the Jacobi-Symbol of
- exact non-negative integer @var{p} and exact positive odd integer @var{q}.
+Returns the value (+1, @minus{}1, or 0) of the Jacobi-Symbol of
+exact non-negative integer @var{p} and exact positive odd integer @var{q}.
 @end defun
 
-
 @defvar prime:trials
 
- @var{prime:trials} the maxinum number of iterations of Solovay-Strassen that will
- be done to test a number for primality.
+@var{prime:trials} the maxinum number of iterations of Solovay-Strassen that will
+be done to test a number for primality.
 @end defvar
 
-
-
-
 @defun prime? n
 
- Returns @code{#f} if @var{n} is composite; @code{#t} if @var{n} is prime.
- There is a slight chance @code{(expt 2 (- prime:trials))} that a
- composite will return @code{#t}.
+Returns @code{#f} if @var{n} is composite; @code{#t} if @var{n} is prime.
+There is a slight chance @code{(expt 2 (- prime:trials))} that a
+composite will return @code{#t}.
 @end defun
 
-
-
 @defun primes< start count
 
- Returns a list of the first @var{count} prime numbers less than
- @var{start}.  If there are fewer than @var{count} prime numbers
- less than @var{start}, then the returned list will have fewer than
- @var{start} elements.
+Returns a list of the first @var{count} prime numbers less than
+@var{start}.  If there are fewer than @var{count} prime numbers
+less than @var{start}, then the returned list will have fewer than
+@var{start} elements.
 @end defun
 
-
-
 @defun primes> start count
 
- Returns a list of the first @var{count} prime numbers greater than @var{start}.
+Returns a list of the first @var{count} prime numbers greater than @var{start}.
 @end defun
 
-
-
- 
- 
-
- 
-
-
-
-
-
 @defun factor k
 
- Returns a list of the prime factors of @var{k}.  The order of the
- factors is unspecified.  In order to obtain a sorted list do
- @code{(sort! (factor @var{k}) <)}.
+Returns a list of the prime factors of @var{k}.  The order of the
+factors is unspecified.  In order to obtain a sorted list do
+@code{(sort! (factor @var{k}) <)}.
 @end defun