# Ask the user for a number between 3 and 100 (inclusive). Det…

Ask the user for a number between 3 and 100 (inclusive). Determine if the number is prime; that is, check to see if it is evenly divisible by any number other than itself. You must write a function called isPrime and call it as follows:

The task at hand is to determine whether a given number is prime or not. A prime number is defined as a positive integer greater than 1 that has no positive divisors other than 1 and itself. In order to achieve this, we need to write a function called `isPrime` that accepts a number as an argument and returns a boolean value indicating whether the number is prime or not.

To begin, we can define our `isPrime` function as follows:

“`python
def isPrime(n):
# code to check if n is prime
pass
“`

Now we need to implement the logic to check whether the number is prime or not. One way to accomplish this is by iterating through all numbers from 2 to the square root of the given number and checking if any of them divide the given number evenly. If we find any such divisor, then the number is not prime. However, if no divisor is found, the number is prime.

Here is the updated implementation of the `isPrime` function:

“`python
import math

def isPrime(n):
# check if n is less than 2
if n < 2: return False # iterate from 2 to square root of n for i in range(2, int(math.sqrt(n)) + 1): # check if n is divisible by any number in the range if n % i == 0: return False # if no divisor is found, the number is prime return True ``` Now we can call the `isPrime` function with a given number and it will return `True` if the number is prime, and `False` otherwise. To use this function with a number provided by the user, we can write the following code: ```python # prompt the user for a number number = int(input("Enter a number between 3 and 100 (inclusive): ")) # check if the number is prime using the isPrime function if isPrime(number): print(f"{number} is prime.") else: print(f"{number} is not prime.") ``` In this code snippet, we first prompt the user for a number using the `input` function and convert it to an integer using `int()`. Then, we call the `isPrime` function with the given number and check the return value to determine whether the number is prime or not. Finally, we print the result to the console.