Write the algorithm of prime number?
is the answer same
Answers
Answered by
1
Answer:
In mathematics, the Seive of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limits. It does so by iteratively marking as composite (that is, not prime) the multiples of each prime, starting with the first prime number, 2.
Explanation:
plz. mark me as brainliest and follow me......
Similar questions