|
This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help.
|
|
|
|
This is a featured picture on the English language Wikipedia ( Featured pictures) and is considered one of the finest images.
If you think this file should be featured on Wikimedia Commons as well, feel free to nominate it. If you have an image of similar quality that can be published under a suitable copyright license, be sure to upload it, tag it, and nominate it.
|
|
|
Summary
Animation that visualizes the "Sieve of Eratosthenes" algorithm. Original image at Image:Animation_Sieve_of_Eratosth.gif Original by SKopp (selfmade)
The Sieve of Eratosthenes is an method for efficiently finding all prime numbers up to a number, 120 in this case, by eliminating (colouring in) all multiples of successive primes. It uses the common optimisation 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 needs only consider primes up to 7, because the square of the next prime 11 is 121, larger than any number here.
Licensing
|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License. http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
|
File usage
The following pages on Schools Wikipedia link to this image (list may be incomplete):