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

Last updated: May 14,2024

1. Install "libecm0-dev-common" package

Learn how to install libecm0-dev-common on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libecm0-dev-common
            
                    
    
    Copied

2. Uninstall "libecm0-dev-common" package

This tutorial shows how to uninstall libecm0-dev-common on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libecm0-dev-common
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

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

Package: libecm0-dev-common
Priority: optional
Section: universe/libdevel
Installed-Size: 51
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Architecture: all
Source: gmp-ecm
Version: 6.4.4+ds-5
Replaces: libecm-dev (<= 6.4.4-2)
Provides: libecm-dev-common
Recommends: libecm0-dev (= 6.4.4+ds-5)
Conflicts: libecm-dev (<= 6.4.4-2), libecm-dev-common
Filename: pool/universe/g/gmp-ecm/libecm0-dev-common_6.4.4+ds-5_all.deb
Size: 29152
MD5sum: 6a20f24db6143185ebda047bad83471f
SHA1: 24978704e2eb0933b527b5de1035b5a817ab9875
SHA256: 4f781478fee02a8dc27a9ee3181fb63b05719b3916805cf1f6e0b10e59beda71
Description-en: factor integers using the Elliptic Curve Method -- header
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 header needed by developers.
Description-md5: 15d19f4e1f8d45fad2a62bac9d080cf6
Multi-Arch: foreign
Homepage: http://ecm.gforge.inria.fr/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu