Listing Prime Numbers

I need you to develop some program for me. I would like this program to be developed using Python.

Write a program to list prime numbers for a user.

Recall that a positive integer n is called "prime" if n has exactly two

divisors: 1 and n.

(Note that 1 is NOT a prime number; it only has 1 divisor.)

How to do this: Let the user give three choices:

1. A positive integer, a, for the first prime to start the list.

2. Which they want:

2a. How many consecutive prime numbers to list, starting at a, or

2b. the last number b (with b > a) to consider for the list.

3. The number corresponding to the choice in #2.

Hint: When checking if a number m is prime, you only need to check

possible divisors up to the square root of m. (Think about why!)

Compute the list according to the user's specifications,

print the list to the user, and ask if they want to do it all again.

If they do, be sure you are able to re-use the list you have just computed!

Mac OS Python Softwarearchitektur

Projekt-ID: #15467068

Über das Projekt