input: Write a function to check if a given number is prime. Implement the function named `primeCheck` that takes an integer `num` as input and returns `True` if the number is prime, otherwise returns `False`. If `num` is less than or equal to 1, return `False`.
  assert primeCheck(2) == True
  assert primeCheck(3) == True
  assert primeCheck(4) == False
  assert primeCheck(5) == True
  assert primeCheck(1) == False
output: def primeCheck(num):
      if num <= 1:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True