Maple Share Library:  Number Theory
===================================

Collatz.ms      FILE: numtheor/Collatz.ms
		SEE ALSO: numtheor/Collatz.tex
                The 3x+1 conjecture, or Collatz's problem or Ulam's conjecture.
                The routine DistTo1 computes the number of iterations to 1 in
                an efficient way.
                AUTHOR: Gaston Gonnet, gonnet@inf.ethz.ch

elliptic        > readshare(elliptic, numtheor);
		SEE ALSO: numtheor/elliptic.tex  (49K)
                Determines the order of the group of points on a non-singular
                elliptic curve y^2 = x^3+A*x+B over a finite field Z mod p
                AUTHOR: Eric Von York, eyork@elie.math.nd.edu

irredheu        > readshare(irredheu, numtheor);
                A heuristic irreducibility test of polynomials in Q[x] via
                finding prime evaluations and integer primality testing.
                This is conjectured to be a polynomial time irreducibility test
                AUTHOR: Michael Monagan, monagan@inf.ethz.ch

rootbound       > readshare(irredheu, numtheor);
                Bound on the roots of a polynomial in Q[x]
                AUTHOR: Michael Monagan, monagan@daisy.waterloo.edu
                AUTHOR: Erich Kaltofen, kaltofen@turing.cs.rpi.edu


