Revise Listing 5.13, PrimeNumber.py) Listing 5.13 determines

Authors:

Y Daniel Lang

Chapter:

0.lists

Exercise:

Programming Excercises

Question:6 | ISBN:978013274719 | Edition: 6

Question

Revise Listing 5.13, PrimeNumber.py) Listing 5.13 determines whether a number n is prime by checking whether 2, 3, 4, 5, 6, ..., n/2 is a divisor for n. If a divisor is found, n is not prime. A more efficient approach is to check whether any of the prime numbers less than or equal to $\sqrt{n}$ can divide n evenly. If not, n is prime. Rewrite Listing 5.13 to display the first 50 prime numbers using this approach. You need to use a list to store the prime numbers and later use them to check whether they are possible divisors for n