input: Write a function to determine if a given number is prime or composite. If the number is prime return True, otherwise return False. If the number is less than 2, return False.
  
  def is_prime_number(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_number(10) == False
  assert is_prime_number(7) == True
  assert is_prime_number(1) == False
  assert is_prime_number(2) == True
  assert is_prime_number(49) == False
output: def is_prime_number(num):
      if num < 2:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True