README file added for LCM

Author: me-shaon

Number Theory/GCD/README.md

@@ -1,4 +1,4 @@
-# Greatest Commond Divisor Finding (Euclidean algorithm)
+# Greatest Common Divisor(GCD) Finding (Euclidean algorithm)
 
 The **Greatest Common Divisor (GCD)** of two integers A and B is the *largest integer that divides both A and B*. For example, the gcd of 8 and 12 is 4.
 

Number Theory/LCM/README.md

@@ -0,0 +1,16 @@
+# Least Common Multiple(LCM) Finding
+
+The **least common multiple**, **lowest common multiple**, or **smallest common multiple** of two integers a and b, usually denoted by **LCM(a, b)**, is the smallest positive integer that is divisible by both a and b.
+
+#### Computing the Least Common Multiple:
+
+The following formula reduces the problem of computing the least common multiple to the problem of computing the greatest common divisor (GCD), also known as the greatest common factor:
+
+```
+lcm(a,b) = (a * b)/gcd(a,b)
+```
+
+
+### More on this topic
+- [LCM - Wikipedia](https://en.wikipedia.org/wiki/Least_common_multiple)
+- [LCM - mathisfun](https://www.mathsisfun.com/least-common-multiple.html)

README.md

@@ -95,7 +95,7 @@
 
 - Number Theory
     - [Greatest Common Divisor (GCD)](./Number%20Theory/GCD/)
-    - Longest Common Multiplier (LCM)
+    - [Longest Common Multiplier (LCM)](./Number%20Theory/LCM/)
     - Euler Totient (Phi)
     - Primality Testing
     - Prime finding(Sieve of Eratosthenes)