From f6329c6c44edcaedeff88f17ffcb700c43d0188e Mon Sep 17 00:00:00 2001 From: Valentina Date: Wed, 3 Oct 2018 07:03:59 +0200 Subject: [PATCH 1/2] added smallest common multiple to math folder --- math/smallest-common-multiple.js | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 math/smallest-common-multiple.js diff --git a/math/smallest-common-multiple.js b/math/smallest-common-multiple.js new file mode 100644 index 0000000..32411a0 --- /dev/null +++ b/math/smallest-common-multiple.js @@ -0,0 +1,32 @@ +// Find the smallest common multiple of the given parameters that can be evenly divided by both, as well as +// by all numbers in the range between these parameters. +// The range is an array of two numbers, not necessarily be in numerical order. + +function smallestCommons(arr) { + arr.sort(function(a, b) { //sorting given numbers + return b - a; + }); + + var num = []; + for (var i = arr[0]; i >= arr[1]; i--) { //create array of all nums + num.push(i); + } + + var quot = 0; //variables for the quotient that can access them outside the loop + var loop = 1; + var n; + // Run code while n is not the same as the array length. + do { + quot = num[0] * loop * num[1]; + for (n = 2; n < num.length; n++) { + if (quot % num[n] !== 0) { + break; + } + } + loop++; + } while (n !== num.length); + + return quot; +} + +smallestCommons([1,5]); \ No newline at end of file From 7132c4abe33c991554c94e8ab74a6669247635fa Mon Sep 17 00:00:00 2001 From: Valentina Date: Wed, 3 Oct 2018 07:04:55 +0200 Subject: [PATCH 2/2] commentary additions --- math/smallest-common-multiple.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/math/smallest-common-multiple.js b/math/smallest-common-multiple.js index 32411a0..7bcbaa6 100644 --- a/math/smallest-common-multiple.js +++ b/math/smallest-common-multiple.js @@ -29,4 +29,4 @@ function smallestCommons(arr) { return quot; } -smallestCommons([1,5]); \ No newline at end of file +smallestCommons([1,5]); //Example of given numbers pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy