How to Install and Uninstall gmp-ecm Package on Ubuntu 16.04 LTS (Xenial Xerus)
Last updated: December 23,2024
1. Install "gmp-ecm" package
Please follow the guidance below to install gmp-ecm on Ubuntu 16.04 LTS (Xenial Xerus)
$
sudo apt update
Copied
$
sudo apt install
gmp-ecm
Copied
2. Uninstall "gmp-ecm" package
Please follow the step by step instructions below to uninstall gmp-ecm on Ubuntu 16.04 LTS (Xenial Xerus):
$
sudo apt remove
gmp-ecm
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the gmp-ecm package on Ubuntu 16.04 LTS (Xenial Xerus)
Package: gmp-ecm
Priority: optional
Section: universe/math
Installed-Size: 100
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Architecture: amd64
Version: 6.4.4+ds-5
Replaces: ecm (<< 1.00-2)
Depends: libc6 (>= 2.14), libecm0, libgmp10 (>= 2:6.0)
Breaks: ecm (<< 1.00-2)
Filename: pool/universe/g/gmp-ecm/gmp-ecm_6.4.4+ds-5_amd64.deb
Size: 30542
MD5sum: 5205247154d8c74e0c0923ea54c45378
SHA1: 20d21396dec35f38126fa8450bce61d5b557571d
SHA256: dc600f528275b6aeda80aae40e43bcddc14d62487b561ef086a691e181d8114d
Description-en: Factor integers using the Elliptic Curve Method
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
information about ecmnet.
.
This package provides the command line utility.
Description-md5: aa8a1ad2382ce8ce2808bef77751b023
Multi-Arch: foreign
Homepage: http://ecm.gforge.inria.fr/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Priority: optional
Section: universe/math
Installed-Size: 100
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Architecture: amd64
Version: 6.4.4+ds-5
Replaces: ecm (<< 1.00-2)
Depends: libc6 (>= 2.14), libecm0, libgmp10 (>= 2:6.0)
Breaks: ecm (<< 1.00-2)
Filename: pool/universe/g/gmp-ecm/gmp-ecm_6.4.4+ds-5_amd64.deb
Size: 30542
MD5sum: 5205247154d8c74e0c0923ea54c45378
SHA1: 20d21396dec35f38126fa8450bce61d5b557571d
SHA256: dc600f528275b6aeda80aae40e43bcddc14d62487b561ef086a691e181d8114d
Description-en: Factor integers using the Elliptic Curve Method
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
information about ecmnet.
.
This package provides the command line utility.
Description-md5: aa8a1ad2382ce8ce2808bef77751b023
Multi-Arch: foreign
Homepage: http://ecm.gforge.inria.fr/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu