: Matemáticas: sieve of Eratosthenes

number > number theory > sieve theory > sieve of Eratosthenes

sieve of Eratosthenes

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit.
It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them that is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime. Once all the multiples of each discovered prime have been marked as composites, the remaining unmarked numbers are primes.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)

http://data.loterre.fr/ark:/67375/PSR-DTTFK7B0-V

RDF/XML TURTLE JSON-LD Creado 18/8/23, última modificación 18/10/24

Loterre