JSFiddle - React, Tailwind, and code Playground

by craigm

JavaScript

//euler #5

var divisors = [11,12,13,14,15,16,17,18,19,20],
    num = 20,
    smallestFound = false,
    divisible = true,
    i;

while (!smallestFound) {
    for (i = 0; i < divisors.length; i++) {
        if (num % divisors[i] !== 0) {
            divisible = false;
            break;
        }
    }
    smallestFound = divisible ? true : false;
    divisible = true;
    num += 2;
}

console.log(num-2);