Search Results for "integer set library"

...See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov...

The Wolfram Machine project is an effort to create a set of documentation and useful modules (both hardware and software) for a computing architecture based on the mathematical theories presented in Steven Wolfram's book _A_New_Kind_of_Science_.

This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.