input: Write a function to identify if a provided number is prime or composite. The function should return True if the number is prime and False if it is composite. If the provided number is 1, it should return False because 1 is considered neither prime nor composite.
  function is_prime(num):
      if num == 1:
          return False
      if num == 2:
          return True
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True
  assert is_prime(10) == False
  assert is_prime(2) == True
  assert is_prime(1) == False
  assert is_prime(13) == True
  assert is_prime(16) == False
output: def is_prime(num):
      if num == 1:
          return False
      if num == 2:
          return True
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True