There is a lot of room for improvement to my NumberSieves package. The package consists of algorithms I extracted and polished up from when I was working on Project Euler problems. It makes solving a number of problems into quick five minute affairs. At some point I would probably do it myself, but I don't have a pressing reason to do it.
http://hackage.haskell.org/package/NumberSieves Possible Improvements I have in mind: 1. Make things faster 2. Reduce memory requirements 3. Parallelize the sieves 4. Incrementalize the Factor and Phi sieves, so that an explicit upper bound is no longer required 5. Remove limitations so that Factor and Phi can sieve beyond 2^32 It would be a small and self-contained project, suitable for anybody who has an interest in Haskell and mathematics! If somebody is interested, by all means contact me via email, and I will share the approach I had in mind. Best, Leon _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe