input: Write a python function to display the prime numbers between 1 and a given number.
  assert find_prime_numbers(10) == [2, 3, 5, 7]
  assert find_prime_numbers(20) == [2, 3, 5, 7, 11, 13, 17, 19]
  assert find_prime_numbers(5) == [2, 3, 5]
output: def find_prime_numbers(n):
      def is_prime(num):
          if num <= 1:
              return False
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      prime_numbers = [num for num in range(2, n+1) if is_prime(num)]
      return prime_numbers