euler003.js

function findPrimeFact(num, accum = []) {
  return 1;
}
function isDivisible(num) {
  return (divisor) => num % divisor === 0;
}
function isPrime(num) {
  return Array.from({length: Math.floor(num/4 - 1)},
      (x, i) => i * 2 + 3)
    .filter(isDivisible(num)).length === 0;
}
//findPrimeFact(600851475143);
//not functional atm