input: Write a function that determines whether a given number is prime or composite. The function should return True if the number is prime and False if the number is composite. If the number is less than 2, the function should return False.
  assert is_prime(10)==False
  assert is_prime(2)==True
  assert is_prime(1)==False
  assert is_prime(37)==True
  assert is_prime(100)==False
output: def is_prime(n):
      if n < 2:
          return False
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return False
      return True