IsPrime

by Matthew Vasallo

JavaScript

let isPrime = num => {
  for (i = num - 1; i > 1; i--) {
    if (num % i === 0) {
      return false;
    }
  }
  return true;
};

let isPrimeRecursive = (num, div) => {
  if (div < 2) {
    return true;
  }
	  return (num % div === 0) ? false : isPrimeRecursive(num, div - 1);
};

const isPrime2 = number => {
		for (int divisor = 2; divisor < number -1; divisor++) {
			if(number % divisor == 0) {
				return false;
			}
		}
		return true;
	}

console.log(isPrimeRecursive(7, 6));
console.log(isPrime(7));