```#=======================================================================
# Author: Isai Damier
# Project: geekviewpoint
# Package: algorithms
#
# Statement:
#   Add the two given positive fractions
#
# Sample Input: [5,6], [7,8])
# Sample Output: [41,24]
#
# Technical Details:
#   This is the same algorithm you learned in grade school:
#   1) find the lowest common denominator, which is the same as finding
#     the lowest common multiplier of the given denominators.
#   2) Convert the given fractions into equivalent fractions with the
#     new denominator
#   4) reduce the resulting fraction by dividing the GCD (greatest
#     common divisor) of its numerator and denominator.
#=======================================================================
denominator = LCM( a, b )
numA = denominator / a * a
numB = denominator / b * b
numerator = numA + numB
gcd = GCD( numerator, denominator )
return [numerator / gcd, denominator / gcd]
```
```import unittest
from algorithms import numbers as algorithm

class Test( unittest.TestCase ):