input: Write a python function to find prime numbers up to a given number using multiprocessing.
  assert find_prime_numbers(10) == [True, True, False, True, False, True, False, False]
  assert find_prime_numbers(20) == [True, True, False, True, False, True, False, False, False, True, False, True, False, False, False, True, False, True]
  assert find_prime_numbers(5) == [True, True, False, True]
output: def find_prime_numbers(n):
      from multiprocessing import Pool
  
      def is_prime(num):
          if num < 2:
              return False
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      with Pool() as pool:
          result = pool.map(is_prime, range(n))
      
      return result