A C++ Library For Computational Number Theory Main Page News Introduction Online Documentation System Requirements License Download Mailing Lists Support, Bug Reports Darmstadt University of Technology Activate LiDIA's Remote Control (JavaScript) NEWS Build problem with gmp arithmetic There's a bug in src/interfaces/udigit/gmp/udigit_def.h that causes the build process with gmp-4.x arithmetic to ...

NTL: A Library for doing Number Theory NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields. A Tour of NTL Download NTL Trouble-shooting guide Contact Info and Mailing Lists Related Links Now available: NTL 5.3 Back to Victor ...

Number Field Sieve NET These pages are about my client/server system for SNFS factoring, it was originally meant for Conrad Curry's NFSNET effort, to help with the assignment and distribution of ranges for sieving, but since the apparent death of that project and Conrad's disappearance I've switched it to handing out ranges from private projects such as 17, 119+, 38, 91+, finished on my birthday: ...

KANT / KASH Computational Algebraic Number Theory / KAnt SHell KANT is a software package for mathematicians interested in algebraic number theory. For those KANT is a tool for sophisticated computations in number fields and in global function fields. With KASH you are able to use the powerful KANT V4 functions within a shell and you do not need to know anything at all about programming in C.

Shamus Software, the developers of the MIRACL library, the fastest multiprecision library in the world!

Number-Theoretic Hacks I have implemented a number of simple number-theoretic algorithms for my own amusement, and provide them here on the net. Egyptian Fractions -- algorithms and references. This notebook for Mathematica 2.2/Macintosh (also available in HTML format) describes and implements a number of different algorithms for representing rational numbers as sums of distinct unit fractions.

CLN - Class Library for Numbers CLN was written by Bruno Haible haible@clisp.cons.org and is currently maintained by Richy Kreckel richard.kreckel@ginac.de . It is distributed under the terms and conditions of the GNU General Public License (GPL). There used to be another webpage of CLN here. It may reappear some time, who knows... Features and Overview CLN is a C++ library providing the ...

ARIBAS ARIBAS is an interactive interpreter for big integer arithmetic and multi-precision floating point arithmetic with a Pascal/Modula like syntax. It has several builtin functions for algorithmic number theory like gcd, Jacobi symbol, Rabin probabilistic prime test, factorization algorithms (Pollard rho, continued fraction, quadratic sieve), etc. NEW in Version 1.20: The precision in ...

P.O. Box 1005 Houston, TX 77251-1005 (281) 773-7078 (281) 333-3575 (fax) email: cschulen@schulenberg.com We are a small software company that specializes in innovative software products in the following major areas: database applications, specialized software tools, foreign language, mathematical modeling, neural networks, and factorization software. We also have extensive experience with ...

Latest Release of Piologie: Version 1.3! Piologie, a library for arbitrary precision arithmetic, operating on natural, integer and rational numbers.

Home page of Primo ...

Implementations of extended LLL In systems like GP/PARI one uses an implementation of the LLL lattice reduction algorithm which allows dependent vectors and which also returns a transformation matrix. However, no complexity analysis is possible for their qflll algorithm (and similar algorithms), at least not in the manner of the original LLL paper. When we speak of extended LLL, we refer to the ...

I began to use Maple in my teaching in January 1995. At that time I was a complete novice in the use of computing in my mathematics teaching, and benefited greatly from a new, temporary colleague, Dr. Mark Daly (that was the happiest time in my professional working life). Mark was an expert in the use of Maple (and much else besides), and to him I owe whatever facility I acquired in using Maple.

Aliquot Ivo Duntsch Rechenzentrum Universitat Osnabruck Germany Bitnet: duentsch@dosuni1 Internet: duentsch@dosuni1.rz.uni-osnabrueck.de A tool to compute aliquot chains with small starting numbers and keep a record of the results. For a positive natural number n, let s(n) denote the sum of its proper divisors. The sequence obtained by iterating s for some n is called an aliquot sequence or ...

Free source of large data sets of prime numbers ...