numlib package

There are different routines implemented in the numlib library in order
to do number theoretic calculations. These are

decimal 	- infinite representation of rational numbers
divisors 	- divisors of an integer
fibonacci 	- Fibonacci numbers
fromAscii 	- decoding of ASCII codes
gadic 		- g-adic representation of a nonnegative integer
ichrem 		- Chinese remainder theorem for integers
igcdmult 	- extended Euclidean algorithm for integers
isquadres 	- test for quadratic residues
issqr 		- test for perfect squares
jacobi 		- Jacobi symbol
lambda 		- Carmichael function
legendre 	- Legendre symbol
lincongruence 	- linear congruence
mersenne 	- Mersenne primes
moebius 	- Moebius function
mroots 		- modular roots of polynomials
msqrts 		- modular square roots
numdivisors 	- number of divisors of an integer
numprimedivisors - number of prime factors of an integer
order 		- order of a residue class
pollard 	- Pollard's rho factorization algorithm
prevprime 	- next smaller prime
prime 		- prime numbers
primedivisors 	- prime factors of an integer
primroot 	- primitive roots
proveprime 	- primality proving using elliptic curves
sigma 		- sum of divisors of an integer
sumdivisors 	- sum of divisors of an integer
tau 		- number of divisors of an integer
toAscii 	- ASCII encoding of a string
