How to Install and Uninstall libecm0 Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: January 23,2025

1. Install "libecm0" package

Here is a brief guide to show you how to install libecm0 on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libecm0
            
                    
    
    Copied

2. Uninstall "libecm0" package

Here is a brief guide to show you how to uninstall libecm0 on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libecm0
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libecm0 package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libecm0
Priority: optional
Section: universe/libs
Installed-Size: 411
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Architecture: amd64
Source: gmp-ecm
Version: 6.4.4+ds-5
Provides: libecm
Depends: libc6 (>= 2.14), libgmp10 (>= 2:6.0)
Recommends: gmp-ecm (= 6.4.4+ds-5)
Conflicts: libecm
Filename: pool/universe/g/gmp-ecm/libecm0_6.4.4+ds-5_amd64.deb
Size: 162808
MD5sum: 0825122eeb6a907b0e0edd1ed40fb57d
SHA1: e9ff66f10d79435d2d25b5bc8498ae1d6db8a41b
SHA256: 5139392836fbf16d1607d24ac907cb5310526faaae982313e1400cccb153cf6d
Description-en: factor integers using the Elliptic Curve Method -- lib
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 shared library.
Description-md5: a5c837165ebf3d6200113254ea62f3af
Multi-Arch: same
Homepage: http://ecm.gforge.inria.fr/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu