From 93ea7fe5957b62f18e8fbd17a21696bd7de6332d Mon Sep 17 00:00:00 2001
From: mjfernez <mjfernez@gmail.com>
Date: Sun, 9 Feb 2020 15:16:26 -0500
Subject: Organized everything, update README

---
 05-Smallest-Multiple/smallmult    | Bin 0 -> 16648 bytes
 05-Smallest-Multiple/smallmult.c  |  23 +++++++++++++++++++++++
 05-Smallest-Multiple/smallmult.py |  29 +++++++++++++++++++++++++++++
 3 files changed, 52 insertions(+)
 create mode 100755 05-Smallest-Multiple/smallmult
 create mode 100644 05-Smallest-Multiple/smallmult.c
 create mode 100644 05-Smallest-Multiple/smallmult.py

(limited to '05-Smallest-Multiple')

diff --git a/05-Smallest-Multiple/smallmult b/05-Smallest-Multiple/smallmult
new file mode 100755
index 0000000..5f4e692
Binary files /dev/null and b/05-Smallest-Multiple/smallmult differ
diff --git a/05-Smallest-Multiple/smallmult.c b/05-Smallest-Multiple/smallmult.c
new file mode 100644
index 0000000..302f19b
--- /dev/null
+++ b/05-Smallest-Multiple/smallmult.c
@@ -0,0 +1,23 @@
+#include <stdlib.h>
+#include <stdio.h>
+
+// num: the number to divide
+// gd: the greatest divisor to count up to
+int isDivisible(int num, int gd){
+    int divisible = 1;
+    for(int i = 1; i < gd; i++){
+        if(num % i != 0)
+            divisible = 0;
+    }
+    return divisible;
+}
+
+int main(){
+    int found = 0;
+    int start = 2520;
+    while(!found){
+        start += 20;
+        found = isDivisible(start, 20); 
+    }
+    printf("%d\n", start);
+}
diff --git a/05-Smallest-Multiple/smallmult.py b/05-Smallest-Multiple/smallmult.py
new file mode 100644
index 0000000..a8a6344
--- /dev/null
+++ b/05-Smallest-Multiple/smallmult.py
@@ -0,0 +1,29 @@
+# Problem 5 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?
+
+import PIL
+import math
+
+
+def isDivisible(num, divisors):
+    divisible = True
+    for j in divisors:
+        if(num % j != 0):
+            divisible = False
+            break
+    return divisible
+
+
+divs = range(1, 21)
+
+found = False
+start = 2520
+while (not found):
+    start += 20
+    found = isDivisible(start, divs)
+
+print(start)
+print(str(isDivisible(start, divs)))
-- 
cgit v1.2.3