Math, asked by piyush1363, 1 year ago

Prepare a sieve for prime numbers.

Answers

Answered by gautam727

Step-by-step explanation:

In mathematics, the Sieve of Eratosthenes 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 first prime number, 2.

piyush1363: thank u sir for your answer

Previous Question

Next Question

Similar questions

Math, 6 months ago

A student wants to develop a model of a plant cell and a model of an animal cell. Plant and animal cells are both eukaryotic and share many common characteristics. Which list best describes the characteristics that should be included in both of the models? A a nucleus, cytoplasm, ribosomes, and chloroplasts that absorb light energy B a nucleus, cytoplasm, lysosomes, and a cell wall that...

Hindi, 6 months ago

जय शंकर की कवियों की रचना एवं की भाषा का नाम लिखिए...

Math, 6 months ago

A total of 100 students play on the Sports Academy’s soccer, track, or basketball teams. No student plays on more than one team. 61 of the students are boys. There are 36 students on soccer teams, 19 are on the girls’ soccer team. There are 35 students on basketball teams, 18 are on the boys’ basketball team. How many boys are on the track team?

Physics, 1 year ago

(g) Airplanes have pressurised cabins for passenger safety while in the atmosphere.