Sieve Of Eratosthenes

The problem

Write a function f(N) that returns all prime numbers up to N

Concepts

Any multiple of a number is not prime

Notes

stop looping on square root of N - all primes are calculated by then