Sieve of Eratosthenes animation
Författare/Upphovsman:
Tillskrivning:
Bilden är taggad "Attribution Required" men ingen tillskrivningsinformation lämnades. Attributionsparametern utelämnades troligen när MediaWiki-mallen användes för CC-BY-licenserna. Författare och upphovsmän hittar ett exempel för korrekt användning av mallarna här.
Kreditera:
Eget arbete, Original image at Image:Animation_Sieve_of_Eratosth.gif
Kort länk:
Källa:
Upplösning:
445 x 369 Pixel (157448 Bytes)
Beskrivning:
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 (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.
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.
Licens:
Licensvillkor:
Creative Commons Attribution-Share Alike 3.0
Mer information om licensen för bilden finns här. Senaste uppdateringen: Fri, 11 Oct 2024 23:43:48 GMT