<!-- #################################################################### -->
<!-- ## ## -->
<!-- ## abstract.xml FactInt documentation Stefan Kohl ## -->
<!-- ## ## -->
<!-- #################################################################### -->
This package for &GAP; 4 provides a general-purpose integer
factorization routine, which makes use of a combination of factoring
methods. In particular it contains implementations of the following
algorithms:
<List>
<Item>Pollard's <M>p-1</M></Item>
<Item>Williams' <M>p+1</M></Item>
<Item>Elliptic Curves Method (ECM)</Item>
<Item>Continued Fraction Algorithm (CFRAC)</Item>
<Item>Multiple Polynomial Quadratic Sieve (MPQS)</Item>
</List>
It also contains code by Frank Lübeck for making use of Richard P.
Brent's tables of factors of integers of the form <M>b^k \pm 1</M>.
&FactInt; is completely written in the &GAP; language and contains /
requires no external binaries. It needs <Package>GAPDoc</Package> 1.6
<Cite Key="GAPDoc"/> or higher. &FactInt; must be installed in the
<File>pkg</File> subdirectory of the &GAP; distribution.
<!-- #################################################################### -->
¤ Dauer der Verarbeitung: 0.1 Sekunden
¤
*© Formatika GbR, Deutschland