Material Detail

Sieve of Eratosthenes

Sieve of Eratosthenes

This Java applet simulates Eratosthenes' step-by-step algorithm for collecting prime numbers. Click the button labeled "2" and watch as the applet crosses out all the even numbers from the array. With every click, the applet replaces the number appearing in that button with the next available prime, then crosses out its multiples, ultimately leaving only primes. Increase or decrease the array as desired....

Show More

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.