Merge pull request keon#52 from ofek/master

add lcm

Author: keon

README.md

@@ -93,7 +93,7 @@ Minimal and clean example implementations of data structures and algorithms in P
     - [valid_sudoku](map/valid_sudoku.py)
 - [math](math)
     - [extended_gcd](math/extended_gcd.py)
-    - [gcd](math/gcd.py)
+    - [gcd/lcm](math/gcd.py)
     - [prime_test](math/prime_test.py)
     - [primes_sieve_of_eratosthenes](math/primes_sieve_of_eratosthenes.py)
     - [generate_strobogrammtic](math/generate_strobogrammtic.py)

math/gcd.py

@@ -1,10 +1,13 @@
-'''
-Computes gcd of integers a and b using Euclid's Algorithm
-'''
-
-
 def gcd(a, b):
+    """Computes the greatest common divisor of integers a and b using
+    Euclid's Algorithm.
+    """
     while True:
         if b == 0:
             return a
         a, b = b, a % b
+
+
+def lcm(a, b):
+    """Computes the lowest common multiple of integers a and b."""
+    return a * b / gcd(a, b)