challenge-algorithms-v2.0-Patrick-Reis-Santos/05-isPrime/index.js

export function isPrime(value) {
  for (let divisor = 2; divisor < value; divisor++)
    if (value % divisor === 0) {
      return false;
    }
  return true;
  /*   for (var divisor = 2; divisor <= value; divisor++)
    if (value % divisor == 0) return true;
    else false; */
  // implementar logica aqui 2 1 / 2
}