Prime Numbers - Javascript

primeNumbers.js

// Prime Number
const isPrime = number =>
  number > 1 &&
  Array(Math.floor(Math.sqrt(number)) - 1)
    .fill(0)
    .map((_, i) => i + 2)
    .every(i => number % i !== 0);

function isPrime2(number) {
  if (number < 1) return false;
  for (let i = 2; i < number; ++i) if (number % i === 0) return false;
  return true;
}

const findPrime = (...numbers) =>
  numbers.forEach(number =>
    isPrime(number)
      ? console.log(`${number} is prime!💚`)
      : console.log(`${number} is not prime.❌`),
  );

// Test
const numbers = Array(10)
  .fill(0)
  .map(() => Math.floor(Math.random() * 1000));
findPrime(...numbers);

const numbers2 = Array(1000)
  .fill(0)
  .map((_, i) => i + 1);
findPrime(...numbers2);