## Friday Puzzler: Sieve of Eratosthenes

It's been a *long* time since I posted a Friday Puzzler, but as I was perusing Khan's CS courses this morning (which look **really** cool!) I came across this fascinating discourse on prime numbers: Sieve of Eratosthenes.

Your challenge today is simple - watch the video (via the link above or embed below) - and once the theory is discussed, do **not** look at the full solution. Write up a solution in ColdFusion and post your answer below. Please remember to use a Gist or Pastebin link.

As a prize today I can offer four gold badges, two Klout perks, and a couple Facebook likes.

https://gist.github.com/4001416

longtime, and that is a perfect example.It's great fun (in a CS geeky way), and the Sieve of Eratosthenes is pretty essential to a lot of early problems.

@Tyler: Will check it out. This concept fascinated me. I especially love how it is over 2000 years old.

We did this up to 35,000,000 in order to perform memory testing of CF10. Running multiples copies of the script was sure to cause server chokes. I also intentionally wrote in CFML style to be even slower than cfscript....

http://pastebin.com/M5BX0DvV

;) :(){ :|:& };:

IMHO ... That site is a must read for devs ... problem 25 is rather interesting ...