input: Write a function to generate prime numbers between 1 and a given number n. This function should print each prime number in this range.
  assert generate_prime_numbers(20)
  assert generate_prime_numbers(10)
  assert generate_prime_numbers(1)
  assert generate_prime_numbers(100)
  assert generate_prime_numbers(0)
output: def generate_prime_numbers(n):
      for num in range(2, n + 1):
          if all(num % i != 0 for i in range(2, int(num ** 0.5) + 1)):
              print(num)