naiveTest = n => {
  for (let i = 2; i < n; ++i) {
    if (n % i === 0) {
      return false;
    }
  }
  return true;
}
Checks whether a number is prime using the naive algorithm O(n)

@param Number

@return Boolean