Math, asked by vy5136906, 1 day ago

Eratosthenes' method of finding prime numbers

Answers

Answered by AdritaSingha

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 the multiples of each prime, starting with the first prime number, 2.

Mark me as brainliest

Previous Question

Next Question

Similar questions

India Languages, 16 hours ago

4 ई) गद्यांश पठित्वा माध्यमभाषाय अनुवादं कुरुत। छात्राः-आचार्ये नमोनमः। शिक्षका - नमोनमः। सुप्रभातम्। उपविशत। सौरभः तनयः च- आचार्ये, अपि मार्जयाव फलकम् ? शिक्षकाः - अवश्यम्। मार्जयतम्। सुवचनमपि लिखतम्। नीरजे, वातायनम् उध्दाटय। अतीव उष्मा बाधते। अयि मृदुले, व्यजनानि चालय।...

Math, 16 hours ago

Government dues are which creditors ...

Math, 16 hours ago

. A shopkeeper buys a book for Rs 60 and sell it for Rs 70. What is his profit? *...

Math, 1 day ago

Lcm of 1 and root 2...

Chemistry, 1 day ago

the volume of h2 at stp required to completely reduce 80 grams of fe2O3...

Economy, 8 months ago

sथापन वस्तुएं क्या होती है...

Hindi, 8 months ago

See the attachment. Plz answer fast.

Math, 8 months ago

Given cot theta =7/8 then evaluate (i) (1+ sin theta) (1 - sin theta) (1+ cos theta) (1 - Costheta) (ii) (1 + sin theta) costheta...

Eratosthenes' method of finding prime numbers​

Answers

Eratosthenes' method of finding prime numbers