input: Write a function to check if a given number is prime. If the number is less than 2, return False. For numbers greater than 2, check if it is divisible by any number from 2 up to the number itself. If it is divisible by any of these numbers, return False. Otherwise, return True.
  assert primeCheck(2) == True
  assert primeCheck(3) == True
  assert primeCheck(4) == False
  assert primeCheck(5) == True
  assert primeCheck(1) == False
output: def primeCheck(n):
      if n < 2:
          return False
      for i in range(2, n):
          if n % i == 0:
              return False
      return True