Computer Science, asked by abinaveputhanpurayil, 7 months ago

algorithm to find prime numbers less than 100

Answers

Answered by Itschocolaty

3

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.

Answered by captverma

6

Answer:

ok...sure....

Explanation:

sure. .......

Previous Question

Next Question

Similar questions

Math, 3 months ago

2) FILL IN THE BOX WITH THE CORRECT SYMBOL OUT OF >,< AND = 5/-11[ ] -5/11...

Math, 3 months ago

let find the square root of the 256 by division method...

Math, 3 months ago

2. (a) A architect wants to cover a 40 m by 12 m rectangular area with small stones. If she uses 120 cubic metres of stones, how deep will they be?

English, 7 months ago

Fill in the blanks of the following test with preposition. in out upon to of for during The moon is a very familiar figure (a)--all of us. She awakens a feeling (5) - love and tenderness ( cour heants. (d)-a moonlit night even the infant in arms stretches (e)-its hands to grasp this beautiful object. Nor is her appeal confined (f)- only children. Even since the stirring of the poetic faculty in...

Social Sciences, 7 months ago

Freedom struggle in these countries involved wars against the rulers. Briefly describe it's impact...

Science, 11 months ago

What is plasma's energy source on earth?

Math, 11 months ago

Sarfraz Walked 2km 500m From his house to the station, travelled 375km by train and then travelled 80km by bus to Govindpur village. On the way back, He took a taxi straight home and travelled 420km. Which route was shorter and by how much?

Physics, 11 months ago

the resultant of two forces when they act at an angle of 60° gives 14 newtown.if the same forces are acting at right angle,their resultant is square root of 136 newton. determine magnitude of 2 forces?