Finding the Mth prime number print("Is The Integer Prime?")#ask the user to input an integer NN = int(input("Enter an integer: "))# initialize an empty list to store the factorsfactors = []#loop through the integers from 1 to N-1for i in range(2, N):#check if i is a factor of Nif N % i == 0:#ifi is a factor, append it to the list of factorsfactors.append(i)#check if the length of the list of factors is 0if len(factors) == 0:#if the length of the list of factors is 0, N is a prime numberprint(f"{N} is Prime")else:# if the length of the list of factors is not 0, N is not a prime numberprint(f"{N} is not Prime") Finding the Mth Prime NumberWrite a well-documented Python program, hmwk3Q1.py that finds the Mth prime number by extending hmwk2Q3.py,which finds the prime number for a single number. Have your program query the user for the integer M. Print the valueof the 908th prime number and record it as a comment in your Python program.Hints:Re-use hmwk2Q3.py software by embedding it in a while-loop. The while-loop continues to call upon the prime numbercode until it finds the 908th prime number. Make sure that inside the while-loop you implement a counter, which isincremented when a prime number is found.

1) Below is python program to find Nth prime number It display's the message to user for prime…

Answered: Finding the Mth Prime Number Write a…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

Finding the Mth prime number

Expert Solution

Explanation

1) Below is python program to find Nth prime number

It display's the message to user for prime checking
Ask user to enter an integer using input function, convert it to integer and assign it to num variable
Initialize number and prime count
Run loop to continue call upon prime numbers
- Initialize an empty list to store the factors
- Loop through integers from 2 to number
  - Check if i is a factor of count
    - append the factor with prime number
- If length of factors is 0, means it is a prime number
  - increase prime count
- If prime count the user selected number, display prime and break from while loop
- increment number to check for next prime