Michele Lacchia

Ok! :) I have noticed that sometimes `mom.math.make_prime_sieve` gives wrong results: ``` In [2]: filter(lambda n: not mom.math.is_prime(n), mom.math.make_prime_sieve(10)) Out[2]: [9] In [3]: filter(lambda n: not mom.math.is_prime(n), mom.math.make_prime_sieve(100)) Out[3]: []...

Oh no, it wouldn't be fast enough! On stackoverflow I saw an optimized sieve, I only have to find it. EDIT: Here it is! ``` def rwh_primes1(n): # http://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188 """...

Yes it is! :)

Thanks for explaining the issue! I'll happily wait for clarification, I'm learning Haskell myself.

AFAIK wheels _are_ a binary distribution. 1. I think that the situation is the same (I don't know exactly what progress is being made on the pip front). Here however:...

What's the status on this one? Any news?

I don't understand what's the difficulty here. I don't see anything blocking this, but nothing is happening.