Prime Finder

Problem Statement

Find all prime numbers up to a given limit.

Background

A prime number is only divisible by 1 and itself. The Sieve of Eratosthenes is an efficient algorithm:

1. Create a list of numbers from 2 to n
2. Start with the first prime (2)
3. Remove all multiples of that prime
4. Move to the next unmarked number
5. Repeat until done

Your Task

Write a function find_primes(n) that returns all prime numbers up to n.

Output Format

Return a list of prime numbers in ascending order.