DEV Community

loading...

Discussion on: Project Euler #5 - Finding the Smallest Multiple

Collapse
cyberbot143 profile image
Sai krishna V

const oneTo20Array = Array.from({ length: 20 }, (_, i) => i + 1);

const isDivisibleByOneTo20 = num => oneTo20Array.every(cur => num % cur === 0);

let isFound = false,
  minDiv = 19;

do {
  ++minDiv;
  if (isDivisibleByOneTo20(minDiv)) isFound = true;
} while (!isFound);

console.log(minDiv); //2327925600