```/***************************************************************************
*  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 using the GCD (greatest common
*     divisor) of its numerator and denominator.
*
**************************************************************************/
public int[] addingFractions(int[] a, int[] b) {
int denominator = LCM(a, b);
int numA = denominator / a * a;
int numB = denominator / b * b;
int numerator = numA + numB;
int gcd = GCD(numerator, denominator);
return new int[]{numerator / gcd, denominator / gcd};
}```
```import org.junit.Test;
import static org.junit.Assert.*;

public class NumbersTest {

/**
* Test of addingFractions method, of class Numbers.
*/
@Test