How do you check if a number is prime?

Computer Science Math
9

Somehow implement the sieve of Eratosthene. [ O(log(log(n)) vs O(n) ] Sieve of Eratosthenes - Wikipedia