input: Write a function to determine if a given number is prime or composite. The function should return True if the number is prime and False if it is composite. If the number is less than 2, return False.
  
  class PrimeNumber:
      def __init__(self, num):
          self.num = num
  
      def is_prime(self):
          if self.num < 2:
              return False
          for i in range(2, int(self.num**0.5) + 1):
              if self.num % i == 0:
                  return False
          return True
  
  assert PrimeNumber(10).is_prime() == False
  assert PrimeNumber(29).is_prime() == True
  assert PrimeNumber(1).is_prime() == False
  assert PrimeNumber(2).is_prime() == True
  assert PrimeNumber(49).is_prime() == False
output: def is_prime(self):
      if self.num < 2:
          return False
      for i in range(2, int(self.num**0.5) + 1):
          if self.num % i == 0:
              return False
      return True