input: Write a python function to check if numbers in a list are prime using the given is_prime function.
  assert check_primes([2, 3, 4, 5, 6, 7, 8, 9, 10]) == [True, True, False, True, False, True, False, False, False]
  assert check_primes([11, 13, 17, 19, 23, 29, 31]) == [True, True, True, True, True, True, True]
  assert check_primes([1, 2, 3, 14, 15, 16, 17]) == [False, True, True, False, False, False, True]
output: def is_prime(n):
      if n <= 1:
          return False
      if n <= 3:
          return True
      if n % 2 == 0 or n % 3 == 0:
          return False
      i = 5
      while i * i <= n:
          if n % i == 0 or n % (i + 2) == 0:
              return False
          i += 6
      return True
  
  def check_primes(lst):
      return [is_prime(x) for x in lst]