SUSE Package Hub 15 SP1 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP1-Backports-Pool Package Hub 15 SP1 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP1 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP1-Backports-Pool Package Hub 15 SP1 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP2 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP2-Backports-Pool Package Hub 15 SP2 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP2 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP2-Backports-Pool Package Hub 15 SP2 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP3 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP3-Backports-Pool Package Hub 15 SP3 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP3 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP3-Backports-Pool Package Hub 15 SP3 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP4 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP4-Backports-Pool Package Hub 15 SP4 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP4 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP4-Backports-Pool Package Hub 15 SP4 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP5 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP5-Standard-Pool Package Hub 15 SP5 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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. SUSE Package Hub 15 SP5 one-click install Install python-pyprimes NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-SP5-Standard-Pool Package Hub 15 SP5 Dummy repo - this will fail python-pyprimes Generate and test for prime numbers 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.