How to Install and Uninstall python39-pyprimes Package on openSuSE Tumbleweed

Last updated: December 26,2024

1. Install "python39-pyprimes" package

Please follow the steps below to install python39-pyprimes on openSuSE Tumbleweed


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                python39-pyprimes
            
                    
    
    Copied

2. Uninstall "python39-pyprimes" package

Please follow the guidance below to uninstall python39-pyprimes on openSuSE Tumbleweed:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                python39-pyprimes
            
                    
    
    Copied

3. Information about the python39-pyprimes package on openSuSE Tumbleweed

Information for package python39-pyprimes:
------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python39-pyprimes
Version : 0.2.2a-1.26
Arch : noarch
Vendor : openSUSE
Installed Size : 266.2 KiB
Installed : No
Status : not installed
Source package : python-pyprimes-0.2.2a-1.26.src
Upstream URL : http://code.google.com/p/pyprimes/
Summary : Generate and test for prime numbers
Description :
The pyprimes package offers a variety of algorithms for generating prime
numbers and fast primality tests, written in pure Python.
Prime numbers are those positive integers which are not divisible exactly
by any number other than itself or one. Generating primes and testing for
primality has been a favourite mathematical pastime for centuries, as well
as of great practical importance for encrypting data.
``pyprimes`` includes the following features:
- Produce prime numbers lazily, on demand.
- Effective algorithms including Sieve of Eratosthenes, Croft Spiral,
and Wheel Factorisation.
- Efficiently test whether numbers are prime, using both deterministic
(exact) and probabilistic primality tests.
- Examples of what *not* to do are provided, including naive trial
division, Turner's algorithm, and primality testing using a
regular expression.
- Factorise small numbers into the product of prime factors.
- Suitable for Python 2.4 through 3.x from one code base.