By: jakk
Views: 185 | LoveIts: 1
Description: In mathematics, the Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to a specified integer. we make a map of numbers from 1, red dot are prime, other ones are not. You can choose the size of dot (reset with the green flag) algorithm from wikipedia: 1. Wri ... show more
By: chutty
Views: 13 | LoveIts: 0
Description: find the primes from 2 to 50 by clicking on a number below 10 to cancel it multiples -chutty
By: Techie31415
Views: 10 | LoveIts: 0
Description: This is a fast program to generate Mersenne Primes. The list "Mersenne Prime N" shows the prime n in the function 2^n -1, which is also prime, and the list "primes" simply shows the primes that have been checked. To make this MUCH faster, download it and run it using Turbo mode( ... show more
