English: Animation that visualizes the "Sieve of Eratosthenes" algorithm.
The Sieve of Eratosthenes is an method for efficiently finding all prime numbers up to a number, 120 in this case, by eliminating all multiples of successive primes. It uses the common optimization of starting at p2 for each prime p, as all non-primes (composites) up to p2 were found in previous passes. Because of this it only needs to consider primes up to 7, because the square of the next prime 11 is 121, larger than any number here.
ڕێکەوت
سەرچاوە
بەرھەمی خۆم. Inspired on a similar picture by SKopp.
Add a one-line explanation of what this file represents
L'algorithme "Crible d'Eratosthène" est une méthode pour efficacement trouver tout les nombres premiers d'un nombre jusqu'à un autre nombre, 120 dans ce cas, en éliminant tout les multiples des premiers successifs.