If you're looking to generate all the numbers with exactly two prime factors (counting multiplicity), I have clojure code that generates the ones up to 10^8 in under two minutes:
com.example.sbox=> (time (count (semiprimes-to 100000000))) "Elapsed time: 106157.33292 msecs" 41803068 It's single-threaded code running on a 2.5GHz machine, so I didn't achieve this through massive parallelism or running it on a Cray or anything. :) If anyone wants more details or the code itself I can post it or email it. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
