Announce: PyPrimes 0.2.1a
steve+comp.lang.python at pearwood.info
Thu Jan 8 12:20:52 CET 2015
Christian Gollwitzer wrote:
> Hi Steve,
> Am 08.01.15 um 05:35 schrieb Steven D'Aprano:
>> At long last, I am pleased to announce the latest version of PyPrimes, a
>> pure Python package for working with prime numbers.
>> PyPrimes is compatible with Python 2 and 3, and includes multiple
>> algorithms for the generating and testing of prime numbers, including the
>> Sieve of Eratosthenes, Croft Spiral, Miller-Rabin and Fermat
>> probabilistic tests.
> I don't want to badmouth your effort, but it seems to me that this is
> still a collectino of rather simple algorithms. What about the AKS test,
> which is O(P) and deterministic for all primes, what about elliptic
> curve factorization or a quadratic sieve?
It's a 0.2 version number, what do you expect? :-)
AKS may be O(P), but the constant factor is quite large. In practice I
expect that it will probably be slower than Miller-Rabin. Nevertheless,
I'll eventually include that.
More information about the Python-list