From 74d5715d00f70b3b4a712ae1c5fa4364717436ea Mon Sep 17 00:00:00 2001 From: Waddah Date: Thu, 15 Oct 2020 20:37:32 +0300 Subject: [PATCH] add a solution for Project Euler problem #005 --- Project-Euler/Problem005.js | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 Project-Euler/Problem005.js diff --git a/Project-Euler/Problem005.js b/Project-Euler/Problem005.js new file mode 100644 index 000000000..0ba30669a --- /dev/null +++ b/Project-Euler/Problem005.js @@ -0,0 +1,22 @@ +/* +Smallest multiple + +2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. +What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20? +*/ + +const findSmallestMultiple = () => { + const divisors = [20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2] + let num = 21 + let result + + while (!result) { + const isDivisibleByAll = divisors.every((divisor) => num % divisor === 0) + if (isDivisibleByAll) result = num + else num++ + } + + return result +} + +console.log(findSmallestMultiple())