From 27f3ab4dedece9ea95679672673a84c89af13519 Mon Sep 17 00:00:00 2001
From: kelvinchanwh <35751887+kelvinchanwh@users.noreply.github.com>
Date: Sat, 17 Oct 2020 16:59:15 +0800
Subject: [PATCH 1/2] Find lowest common denominator

---
 lcm.py | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 lcm.py

diff --git a/lcm.py b/lcm.py
new file mode 100644
index 0000000..b4d365a
--- /dev/null
+++ b/lcm.py
@@ -0,0 +1,20 @@
+from math import *
+
+#Calculates Lowest Common Multiple
+def compute_lcm(x, y):
+
+   # Select larger number
+   if x > y:
+       larger = x
+   else:
+       larger = y
+
+   while((larger % x != 0) or (larger % y != 0)):
+       larger += 1
+
+   return larger
+
+in1 = int(input("Insert 1st number: "))
+in2 = int(input("Insert 2nd number: "))
+
+print("LCM of %d and %d is"%(in1, in2), compute_lcm(in1, in2))
\ No newline at end of file

From bba93db6fe6ab29ec90be0fa4b198f2785bde2d9 Mon Sep 17 00:00:00 2001
From: kelvinchanwh <35751887+kelvinchanwh@users.noreply.github.com>
Date: Sun, 18 Oct 2020 04:08:35 +0800
Subject: [PATCH 2/2] Added comments regarding how the loop functions

---
 lcm.py | 18 ++++++++++--------
 1 file changed, 10 insertions(+), 8 deletions(-)

diff --git a/lcm.py b/lcm.py
index b4d365a..a013ed5 100644
--- a/lcm.py
+++ b/lcm.py
@@ -3,16 +3,18 @@
 #Calculates Lowest Common Multiple
 def compute_lcm(x, y):
 
-   # Select larger number
-   if x > y:
-       larger = x
-   else:
-       larger = y
+	# Select larger number
+	if x > y:
+	  	larger = x
+	else:
+		larger = y
 
-   while((larger % x != 0) or (larger % y != 0)):
-       larger += 1
+	# Checks if the larger value is divisible by both numbers
+	while((larger % x != 0) or (larger % y != 0)):
+			# If not divisible by either number, the larger value is incremented by 1
+	    larger += 1
 
-   return larger
+	return larger
 
 in1 = int(input("Insert 1st number: "))
 in2 = int(input("Insert 2nd number: "))