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

Last updated: May 15,2024

1. Install "libecm0-dev" package

Please follow the guidelines below to install libecm0-dev on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libecm0-dev
            
                    
    
    Copied

2. Uninstall "libecm0-dev" package

Please follow the steps below to uninstall libecm0-dev on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libecm0-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

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

Package: libecm0-dev
Priority: optional
Section: universe/libdevel
Installed-Size: 637
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Architecture: amd64
Source: gmp-ecm
Version: 6.4.4+ds-5
Replaces: libecm-dev (<= 6.4.4-2)
Provides: libecm-dev
Depends: libecm0 (= 6.4.4+ds-5), libecm0-dev-common (= 6.4.4+ds-5), libgmp-dev
Conflicts: libecm-dev (<= 6.4.4-2)
Filename: pool/universe/g/gmp-ecm/libecm0-dev_6.4.4+ds-5_amd64.deb
Size: 149150
MD5sum: b299df0d6884f3adfae99eeef5846df2
SHA1: 60634814facf9fc391a830ee950a62012ba17b4e
SHA256: ba2d3096abad2f27b01b1131310cb6cf45e82e5b8b0e2b70cd8ae4732590dbb7
Description-en: factor integers using the Elliptic Curve Method -- libdev
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 static library and symbolic links needed
for development.
Description-md5: beb8d89ac8956188f513800bd8eb5fec
Multi-Arch: same
Homepage: http://ecm.gforge.inria.fr/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu