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