input: Write a function to identify if a provided number is prime or composite. If the number is prime, return True, else return False. If the provided number is less than 2, return False.
  
  def is_prime(num):
      if num < 2:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  assert is_prime(2) == True
  assert is_prime(10) == False
  assert is_prime(13) == True
  assert is_prime(1) == False
  assert is_prime(-5) == False
  
output: def is_prime(num):
      if num < 2:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True