Summer’s over — what’s your move? Join Pro for 50% off using code [MAKEITHAPPEN](https://www.codecademy.com/checkout?periods=year&plan_id=proGoldAnnualV2&discountCode=MAKEITHAPPEN)


Try the Prime Number Finder interview problem.

Prime Number Finder

Create a `prime_finder()` function that takes in a number, `n`, and returns all the prime numbers from `1` to `n` (inclusive). As a reminder, a prime number is a number that is only divisible by `1` and itself.

For example, `prime_finder(11)` should return `[2, 3, 5, 7, 11]`.

Variations of this challenge have been reported to have been asked at interviews with Facebook. If you've covered the material in [Pass the Technical Interview with Python](https://www.codecademy.com/learn/paths/pass-the-technical-interview-with-python) or an equivalent, you should be able to solve this challenge. If you have trouble, try refreshing your knowledge there first.
