Parents (Total: 5)

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

Key	Value
FileName	http://archlinux.mirror.root.lu//pool//community//gap-4.11.0-9-x86_64.pkg.tar.zst
MD5	FE59DA17EDA7D3546E4E73508574459C
SHA-1	53B8E79F1899A11BE8FE7A813217490B4B740A7A
SHA-256	1906B76E133060F5705CE09672B49FF55DBC707443B562C27487B7AA29C75ECB
SSDEEP	3145728:IWK5nCHkeL5fd/N2PZxUR4aoXI1mFTF49IeO+v:m5nC1L5lMPjURnIIT9fPv
TLSH	T1725833403B922A6DC2176B31DAC1BD64FDDC0EA05967A5DE8EB3E494387E3182D90D1F

Key	Value
FileName	http://archlinux.mirror.root.lu//pool//community//gap-4.11.1-1-x86_64.pkg.tar.zst
MD5	B4D02615F6C3EC433F0318E76498F025
SHA-1	24D0C902975147319EBAB100D55BBC6D6D63EDC7
SHA-256	40F60228C10996D0AA74E0EFFBFDB699960DD550C2E15F5D117F7862057948B2
SSDEEP	3145728:GuFozmUZk/hbjkjAFow5yl+KEgXIJDkGAYomSLTACmi:ZpsjASw5ylJEQIxomzQ
TLSH	T1ED783351C161D26FF2400371B3C14EA8F7425CA0E91B79FB9273F26435AEB29F692687

Key	Value
MD5	56E3452186ED7500C9CF92985F5EAA35
PackageArch	noarch
PackageDescription	FactInt 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.
PackageMaintainer	Fedora Project
PackageName	gap-pkg-factint
PackageRelease	3.fc33
PackageVersion	1.6.3
SHA-1	F808564D2630EE21CA397B482F7A110936074A57
SHA-256	BED4BA2C0A39C7DEC3C3B1CEF2381468F98E8E1D8A41F14B5DA0C6A41F90930E

Key	Value
MD5	0999A50EA463CA1AE303ADC31B2DF3EF
PackageArch	noarch
PackageDescription	FactInt 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.
PackageMaintainer	Fedora Project
PackageName	gap-pkg-factint
PackageRelease	2.fc32
PackageVersion	1.6.3
SHA-1	4964237E6C805D57C6376FD80D1D61B63DF4603D
SHA-256	AB453AB715D22C282457C03CEF1930AC3300DE4A6FD8BA6DAFDAB725C3DE6AEB

Key	Value
MD5	FB38C685F8CC226B6B320D1082EEA376
PackageArch	noarch
PackageDescription	FactInt 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.
PackageMaintainer	Fedora Project
PackageName	gap-pkg-factint
PackageRelease	4.fc34
PackageVersion	1.6.3
SHA-1	A1D083A9E4B5CE096C1CC2D2FCE6D12AE6BC7B89
SHA-256	0A1E9CA9AA240D7C17117CC2EFAA43C21164C9451C945CCFFD11C89CF110F42E