Ask Question
18 November, 17:48

To extend the Sieve of Eratosthenes to 200, what is the largest prime whose multiples would have to be considered?

+4
Answers (1)
  1. 18 November, 20:52
    0
    The largest prime that needs to be checked for factors of a number n is floor (sqrt (n)), or |sqrt (n) | in some notations, meaning the largest integer that does not exceed sqrt (n).

    For example, if checking 169, whose squre-root is 13. There will be NO prime factors below 13 (1 is not a prime). So check for all prime factors up to and including the largest prime equal to or less than sqrt (n).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “To extend the Sieve of Eratosthenes to 200, what is the largest prime whose multiples would have to be considered? ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers