Problem5

spec/problem5Spec.js

@@ -0,0 +1,5 @@
+describe("Problem 5 solution", function() {
+  it("smallest number divisible by each number from 1 to 10", function() {
+    expect(smallestDivisibleNum(10)).toEqual(2520);
+  });
+});

src/problem5.js

@@ -0,0 +1,29 @@
+/*
+  Project Euler Problem 5
+  Smallest multiple
+ */
+
+function smallestDivisibleNum(divisors) {
+  var num = 0,
+      found = false,
+      dividesEvenly = [];
+
+  while (!found) {
+
+    num += 2;
+
+    for (var i = 2; i <= divisors; i++) {
+      if (num % i === 0) {
+        dividesEvenly.push(i);
+      }
+    }
+
+    if (dividesEvenly.length + 1 === divisors) {
+      found = true;
+    }
+
+    dividesEvenly = [];
+  }
+
+  return num;
+}