what is sieve of Eratosthenes? give example
Answers
Answered by
1
Answer:
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. ... It may be used to find primes in arithmetic progressions.
Similar questions
Science,
3 months ago
Psychology,
3 months ago
Math,
3 months ago
English,
8 months ago
Social Sciences,
8 months ago
English,
1 year ago