Challenge 3 - Prime Number Finder

Create a function that takes in a number, 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. 

Input: 
Output: