input: Write a function to implement a prime number finder using Python. The function should print all prime numbers from 2 up to a given number n.
  def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      for number in range(2, n + 1):
          if is_prime(number):
              print(number)
  
  assert find_primes(10)==[2, 3, 5, 7]
  assert find_primes(20)==[2, 3, 5, 7, 11, 13, 17, 19]
  assert find_primes(5)==[2, 3, 5]
  assert find_primes(1)==[]
  assert find_primes(0)==[]
output: def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      for number in range(2, n + 1):
          if is_prime(number):
              print(number)