input: Write a function to find prime numbers using Python. The function should iterate from 2 to a given number n and print all prime numbers within that range.
  
  def is_prime(num):
      # Iterate from 2 to the square root of the number
      for i in range(2, int(num ** 0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  def find_primes(n):
      # Iterate from 2 to n
      for i in range(2, n + 1):
          # Check if the number is prime
          if is_prime(i):
              print(i)
  
  # Test cases
  find_primes(20)  # Expected output: 2 3 5 7 11 13 17 19
  find_primes(5)   # Expected output: 2 3 5
output: def find_primes(n):
      for i in range(2, n + 1):
          if is_prime(i):
              print(i)