I stumbled on the above while working on some problems on the following site http://projecteuler.net/
Project Euler also lead to http://www.haskell.org/haskellwiki/Prime_numbers (which Joshua has indirectly brought up, with the infinite prime list in Haskell). The Sieve of Ertosthesthenes is interesting, I don't have any fun examples for when it can be used other than when you are solving programming problems and need a big set of prime numbers in a very short amount of time.
Abram Hindle
unread,
Mar 7, 2013, 9:41:57 PM3/7/13
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Sign in to report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message