Projects

gmpy

A C-coded Python extension module that wraps the GMP library to provide to Python code fast multiprecision arithmetic (integer, rational, and float), random number generation, advanced number-theoretical functions, and more.

primerange

The primerange project is an attempt to generate 'mostly' primes for numbers having 10->20 decimal digits, by using algebraic and non-algebraic techniques. Its usefulness for much larger numbers, has not currently been tested, and it is expected, that the phrase 'mostly' would ... [More] not apply in the case that huge integers are generated. Utilise 'free software' computerised algebra systems Sage, and Python, and C, and GNU gmp library to provide scripts. [Less]

GNU MPFR

Provides a library for multiple-precision floating-point computation with correct rounding. The computation is both efficient and has a well-defined semantics. It copies the good ideas from the ANSI/IEEE-754 standard for double-precision floating-point arithmetic.

AzaMath

AzaMath - Anizoptera CMF mathematic component. Provides functionality to work with large numbers with arbitrary precision (using BCMath) and universal mumeral systems conversions (supported bases from 2 to 62 inclusive, and custom systems; pure PHP, but can use GMP and core functions for speed optimization).

nabu-library

NEW MEMBERS ARE WELCOME!General InformationDescription: Multipurpose .Net library Language: C# Platforms: .Net Framework 3.5, .Net Compact Framework 3.5 Project GoalsDevelop high quality libraries covering common needs Project Structure Project Roadmap

basicqs

This code is a result of hobby programming on linux during 3rd year of my degree (bachelor of engineering), It is a implementation of basic quadritic sieve, that is without self initializing multi polinomial sieve. if u want to factorize seriously large numbers better consider one of these : ggnfs ... [More] (implements number field sieve) or msieve (implements self initializing mutiple polynomial quadratic sieve). This code is an Implementation of Basic Quadratic Sieve, and uses Gaussian elimination method at the final stage. User can control the amount the memory used, no of primes to be used, etc .....see --help option REQUIREMENTSBasic programming environment under Linux(gcc, make, etc....) and gmp library. Papers (Referred)Carl Pomerance - A Tale of two Sieves link: http://www.ams.org/notices/199612/pomerance.pdf Eric Landquist - The Quadratic Sieve Factoring Algorithm link:http://www.math.uiuc.edu/~landquis/quadsieve.pdf Thanks to, Dr. C.S.Yogananda (Head of Mathematics Department SJCE - Mysore). For the support and encouragement. [Less]

cs540-gmp-sse

Vectorization (SSE) and performance study integer multiplication using GMP.

GNU MP wrapper for .NET

A .NET wrapper with simple object interface (written in C#) for GNU MP bignum library (http://gmplib.org/). GNU MP or (short) GMP is ... "...a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. There is no practical limit ... [More] to the precision except the ones implied by the available memory in the machine GMP runs on. GMP has a rich set of functions, and the functions have a regular interface." [Less]

adabindinggmpmpfr

As the GNU libraries GMP and MPFR becomes part of the GNAT free compiler (since they are part of the new GCC) and since these libraries have excellent performances, I thought it could be interesting to create an Ada binding for them. I searched on the Internet and found two old bindings but none ... [More] convinced me and moreover they seemed to have been droped out. Therefore, I have undertaken to write my own binding for GMP and MPFR in Ada 2005. The Binding is as follows : A THIN BINDING mainly composed of two files : gmp.ads and mpfr.ads They basically translate in Ada most functions of gmp.h and mpfr.h but they are not exhaustive yet. There are also some specific files for target dependent types: mp_x86_32bits.ads, mp_x86_64bits.ads... A THICK BINDING with the following specification files : gmp.Integers.ads, gmp.Rationals.ads, mpfr.Floats.ads. These files declare the following types: Unbounded_Integer, Unbounded_Fraction, MPFR_Float that can be seen as extensions of the typical Ada Integer and Float, with operator overloading ("+", "-", ...) and elementary functions. Differences between the two bindings : If you want to keep a full control on precision and rounding, at bit level, then the thin binding to MPFR is needed. But in most cases, if you accept to use accuracy expressed in decimal digits and the rounding of all operations "to nearest", (in fact exactly as it is for classical floating point types in Ada) then the Thick Ada Binding with operator overloading and no C-dependent types is really much easier to use ! Note for Mac OS X users (thanks John) : GNAT from MACADA looks for MPFR and GMP in /usr/local/lib. The libraries may be conveniently built from source using MACPORTS. [Less]

gut-projecteuler

this project holds various solutions to project euler's enigms.