ふるい
エラトステネスの篩
1. Eratosthenes' sieve
2. Sieve of EratosthenesIn mathematics, the sieve of Eratosthenes, one of a number of prime number sieves, is a simple, 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 multiples of 2. The multiples of a given prime are generated starting from that prime, as a sequence of numbers with the same difference, equal to that prime, between consecutive numbers.
Read “Sieve of Eratosthenes” on English Wikipedia
Read “エラトステネスの篩” on Japanese Wikipedia
Read “Sieve of Eratosthenes” on DBpedia
Read “Sieve of Eratosthenes” on English Wikipedia
Read “エラトステネスの篩” on Japanese Wikipedia
Read “Sieve of Eratosthenes” on DBpedia
Discussions
Log in to talk about this word.