Math, asked by rathisamridhi280, 4 days ago

pls tell algorithm of prime number​

Answers

Answered by Prathameshmahajan358
0

Answer:

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

Similar questions