Code to find prime numbers

• Iterate through numbers from 2 to n

• Check if number is divisible by any number from 2 to its square root

• If not divisible, it is a prime number