Information for build gappkgfactint1.5.31.fc24
ID  762497  

Package Name  gappkgfactint  
Version  1.5.3  
Release  1.fc24  
Epoch  
Summary  Advanced methods for factoring integers  
Description  FactInt provides implementations of the following methods for factoring integers:  Pollard's p1  Williams' p+1  Elliptic Curves Method (ECM)  Continued Fraction Algorithm (CFRAC)  Multiple Polynomial Quadratic Sieve (MPQS) FactInt also makes use of Richard P. Brent's tables of known factors of integers of the form bk+/1 for "small" b. The ECM method is suited best for finding factors which are neither too small (i.e. have less than about 12 decimal digits) nor too close to the square root of the number to be factored. The MPQS method is designed for factoring products of two primes of comparable orders of magnitude. CFRAC is the historical predecessor of the MPQS method. Pollard's p1 and Williams' p+1 are useful for finding factors p such that all prime factors of p1 (respectively p+1) are "small", e.g. smaller than 1000000. All factoring methods implemented in this package are probabilistic. In particular the time needed by the ECM method depends largely on luck. FactInt provides a generalpurpose factorization routine which uses an appropriate combination of the methods mentioned above, the Pollard Rho routine which is implemented in the GAP Library and a variety of tricks for special cases to obtain a good average performance for "arbitrary" integers. At the user's option, FactInt provides detailed information about the progress of the factorization process.  
Built by  jjames  
State  complete  
Volume  fedora_koji_archive01  
Started  Fri, 13 May 2016 17:54:17 UTC  
Completed  Fri, 13 May 2016 17:57:42 UTC  
Task  build (f24candidate, /rpms/gappkgfactint:698e0e4b09991aa07d714c8fb5a8ecda8c63c54d)  
Tags 


RPMs 


Logs 


Changelog  * Tue May 03 2016 Jerry James <loganjerry@gmail.com>  1.5.31  Initial RPM 