Ok so, a prime number is always uneven, unless it's 2.
First, check if the number is 2. If it is, return true.
Second, check if the number is even. If it is, return false.
Lastly, if it's an uneven number, I assume something like this would work:
Imagine n is the number you want to check.
Start a cycle with i = 2 for example.
Check if i*i < n. If it is, check if n%i equals 0. If it does, return false.
Increment 1 to i.
If your number survives through this cycle, n is a prime number.
