a prime number is a number that is only evenly divisble by itself and 1. for example, the number 5 is prime because it can only be evenlly divided by 1 and 5. the number 6, however, is not prime because it can be divided evenly by 2 and 3. write a boolean function named is prime which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. use the function in a program that prompts the user to enter a number and then prints whether the number is prime. instructor notes: how do you test if a number is prime? the simplest primality test is trial division: given an input number, n, check whether it is evenly divisible by any prime number between 2 and n (i.e. that the division leaves no remainder). if so, then n is not prime. otherwise, it is prime. ------------------------------------------------------------------------------- to create a python function to determine primality: create a function is prime() to determine whether an integer is prime or not as follows: prompt the user for an integer variable, n. use a for loop with a range. the starting point of the loop will be 2 since 2 is the first prime number. create a variable, x, that will represent (n/2 1) and will be the end point in the range. use another variable, i, as the (loop control) variable. determine if there is a remainder when n is divided by i. pseudocode: i will loop from 2 to x use a decision structure to determine if user input (n) divided by i has a remainder (use the modulus operator - %) if no remainder, return false otherwise, return true then call the function passing the user's response (n)