first 0..100 Prime numbers recursively

isPrimeRecursive.js

function isPrimeNumberRecursive(n, next) {

  if (n <= 1) {
    return false
  }

  if (!next) {
    next = n - 1
  }

  if (next === 1) {
    return true
  }

  if (n % next === 0) {
    return false
  }

  return isPrimeNumberRecursive(n, next - 1)
}

const numbers = [...Array(100).keys()]

numbers.forEach(n => {
  const result = isPrimeNumberRecursive(n)
  result && console.log(n)
})