How to Install and Uninstall libecm1 Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: November 07,2024

1. Install "libecm1" package

Please follow the steps below to install libecm1 on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libecm1
            
                    
    
    Copied

2. Uninstall "libecm1" package

Please follow the guidelines below to uninstall libecm1 on Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libecm1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libecm1 package on Ubuntu 21.04 (Hirsute Hippo)

Package: libecm1
Architecture: amd64
Version: 7.0.4+ds-5
Multi-Arch: same
Priority: optional
Section: universe/libs
Source: gmp-ecm
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 543
Depends: libc6 (>= 2.14), libgmp10 (>= 2:6.1)
Filename: pool/universe/g/gmp-ecm/libecm1_7.0.4+ds-5_amd64.deb
Size: 196044
MD5sum: 86c2a04abc2f34e56e8d69bc28efe6ab
SHA1: f9a1af790878c7d8de4a34ee9226df6132f59b5c
SHA256: ffa041cdb1b446b1f39cf63a6954679c5b75bb0171e0799234de0ea253c922f6
SHA512: 2b5071f0daffcb526527a66c882cd349e8cc3ba6713985de41bcfc18af41dbb5ab8703882627d536f1e40590eb33cc06ab69f3e34140934a6286d05ca8420e27
Homepage: https://ecm.gforge.inria.fr/
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