kedama prime sieve  (2009-Nov-09 16:38 EST)

by <>  (2010-Sep-03 7:42 EDT)

A great project showing graphically what is the Eratosthenes algorithm.

by <>  (2010-Sep-03 7:42 EDT)

Beautiful visualization of the sieve.
Consider change in the setting so the list of the primes will not interweave with the other text.

by <>  (2010-Sep-03 7:42 EDT)

Excellent!

So good I would like to see a follow up on this project. The author followed strictly the original algorithm credited to Eratosthenes, this is "eliminate" all numbers that are múltiples of others, starting by 2, then 3 and so on.

But, today we have the computer. I would like to see the "sieve" in action. Same algorithm but instead of eliminating the multiples, let them go through the sieve and accumulate at the bottom of the vessel.

Or did I miss something?

by <>  (2010-Sep-03 7:42 EDT)

This is a wonderful illustration of the sieve of Eratosthenes. I like the fact that you can set the maximum value of the prime number list. It took me a few times watching before I could figure out what the illustration was doing. I like it, but think a short explanation would benefit that part of the program.

by <>  (2010-Sep-03 7:42 EDT)

Ah, probably I told this to Pierre Andre before, but sumim-san did a version on the similar line. His one is on the Japanese SuperSwiki2 site (but done in the older version of kedama and it doesn't run in the current one) and he also has a movie of it. It does show the sieving in action:


http://squab.no-ip.com:8080/collab/uploads/61/kedamasieve.mov