Result for 0060401E4D457E5EE75E01003068247DCB1F1B8D

Query result

Key Value
FileName./usr/lib/gap/pkg/factint/tables/brent/brfac695
FileSize6932
MD5E35C4F1CCBBD55A68FD32591FCB586A1
SHA-10060401E4D457E5EE75E01003068247DCB1F1B8D
SHA-2566E8898ADF85F92D6B0E0F2BB56D23A43E531A7C708AC207739CEA573ECBC3A51
SSDEEP192:m14WMEyYfiyKFOdc13Zt7oM7YFKNK17vHF6R:mXliPMdc13TocBR
TLSHT1CAE13ED05A4F4F8957C9E6694DCE3F7A46372929293A888770FA7F842B2D70D0B0A50C
hashlookup:parent-total6
hashlookup:trust80

Network graph view

Parents (Total: 6)

The searched file hash is included in 6 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD5949BFBC5748B3581B0772CAFE7ACED3E
PackageArchnoarch
PackageDescriptionFactInt is a GAP 4 package which provides routines for factoring integers, in particular: - Pollard's p-1 - Williams' p+1 - Elliptic Curves Method (ECM) - Continued Fraction Algorithm (CFRAC) - Multiple Polynomial Quadratic Sieve (MPQS) It also provides access to Richard P. Brent's tables of factors of integers of the form b^k +/- 1.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamegap-factint
PackageReleaselp150.1.2
PackageVersion1.6.0
SHA-114E4982671D49198E7C89743FE09F66B1D15CD42
SHA-256B0C78C55F225E9ADA1E7962BDF524D51C0469529BE80B80E574E350FE8E5FAAB
Key Value
MD5E099E83A08A5D1464A8491E7B56D8D92
PackageArchnoarch
PackageDescriptionFactInt is a GAP 4 package which provides routines for factoring integers, in particular: - Pollard's p-1 - Williams' p+1 - Elliptic Curves Method (ECM) - Continued Fraction Algorithm (CFRAC) - Multiple Polynomial Quadratic Sieve (MPQS) It also provides access to Richard P. Brent's tables of factors of integers of the form b^k +/- 1.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamegap-factint
PackageReleaselp151.2.1
PackageVersion1.6.0
SHA-11076780C014479653D383290DBEF7E052BE171B7
SHA-256CB5E1B4A2E44B5C59D32CD102DB8CBC04EB0A5438B711EFB54811FC223B37269
Key Value
MD570BF58133866ECA07E60DA10D3F927AF
PackageArchnoarch
PackageDescriptionFactInt is a GAP 4 package which provides routines for factoring integers, in particular: - Pollard's p-1 - Williams' p+1 - Elliptic Curves Method (ECM) - Continued Fraction Algorithm (CFRAC) - Multiple Polynomial Quadratic Sieve (MPQS) It also provides access to Richard P. Brent's tables of factors of integers of the form b^k +/- 1.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamegap-factint
PackageReleasebp153.1.12
PackageVersion1.6.0
SHA-1B79D166A24D2964C2FDDFCE9C13F6AB1BD752001
SHA-256A74B77F35518FC3AC87B969A7F2205F31356182578A8C6D76100C9BED16EB29E
Key Value
MD5F7D6B572E309F2166DFCEE362362FE7E
PackageArchnoarch
PackageDescriptionFactInt provides implementations of the following methods for factoring integers: - Pollard's p-1 - 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 p-1 and Williams' p+1 are useful for finding factors p such that all prime factors of p-1 (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 general-purpose 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-factint
PackageRelease1.fc24
PackageVersion1.5.3
SHA-144E7B2977B874CBBAFA45D4BBCC5D2E407708CB6
SHA-256222529492DAC798952B6080FB17793A582F0E080B21CBA7B0ACF38C6DDA85643
Key Value
MD52D479446D690855D1EB1613D3473AFE0
PackageArchnoarch
PackageDescriptionFactInt provides implementations of the following methods for factoring integers: - Pollard's p-1 - 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 p-1 and Williams' p+1 are useful for finding factors p such that all prime factors of p-1 (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 general-purpose 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.
PackageMaintainerFedora Project
PackageNamegap-pkg-factint
PackageRelease1.fc24
PackageVersion1.5.3
SHA-18AE7CCD8D8243D3D9A384F82CCDC55BA86EE3FC5
SHA-256B98166B040AEE2FF3C1ABAA55743AC2DF58E3E165A385B22464B30E6162C3DB3
Key Value
MD5A35FE5ECB76043106953AA8C39C10CCA
PackageArchnoarch
PackageDescriptionFactInt is a GAP 4 package which provides routines for factoring integers, in particular: - Pollard's p-1 - Williams' p+1 - Elliptic Curves Method (ECM) - Continued Fraction Algorithm (CFRAC) - Multiple Polynomial Quadratic Sieve (MPQS) It also provides access to Richard P. Brent's tables of factors of integers of the form b^k +/- 1.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamegap-factint
PackageReleaselp152.3.2
PackageVersion1.6.0
SHA-1F51C117B4847CDFEB81FDBFDE968E5FAF6783472
SHA-256972A9B92F54EC6A2B3F8ABBCF143DC2A22774DF07816F58BAFC60C559677B8D3