Exercise
Function To Determine Prime Status
Objective
Develop a Python program with a function called "is_prime" that takes an integer as input and returns True if the number is prime, or False if it is not.
For example, if is_prime(127) returns True, then the number 127 is prime.
Example Python Exercise
Show Python Code
# Define the function to check if a number is prime
def is_prime(number):
# Check for numbers less than 2 (they are not prime)
if number < 2:
return False
# Check for factors from 2 to the square root of the number
for i in range(2, int(number ** 0.5) + 1):
if number % i == 0: # If a factor is found, number is not prime
return False
# If no factors are found, number is prime
return True
# Main function to test the is_prime function
def main():
# Test the function with a prime number
print(is_prime(127)) # Expected output: True
# Test the function with a non-prime number
print(is_prime(100)) # Expected output: False
# Call the main function to execute the program
main()
Output
True
False
Share this Python Exercise