Added Least Common Multiple

AustinZuniga · web-flow · commit f20e953b0e5b · 2019-10-04T08:20:11.000+08:00
diff --git a/Least_Common_Multiple/Problem.txt b/Least_Common_Multiple/Problem.txt
@@ -0,0 +1,6 @@
+## Problem:
+
+The LCM of two integers n1 and n2 is the smallest positive integer that is perfectly 
+divisible by both n1 and n2 (without a remainder). For example: the LCM of 72 and 120 is 360.
+
+write a program written in COBOL that will compute the LCM of 2 numbers
