This script determines if a whole number is prime or composite. Invalid inputs will be recognized.
# Define a function to check if a number is prime def is_prime(n): # If n is less than 2, it is not prime if n < 2: return "Invalid Input." if not isinstance(n, int): raise TypeError("Invalid Input.") # Loop from 2 to the square root of n for i in range(2, int(n**0.5) + 1): # If i divides n evenly, n is not prime if n % i == 0: return "Composite" # If no divisor is found, n is prime return "Prime"