int gcd = greatestCommonDivisor(Math.abs(numerator), denominator); return new Fraction(numerator / gcd, denominator / gcd);
int gcd = greatestCommonDivisor(numerator, denominator); numerator /= gcd; denominator /= gcd; return new Fraction(numerator, denominator);
    public static Fraction getReducedFraction(int numerator, int denominator) {        if (denominator == 0) {            throw new ArithmeticException("The denominator must not be zero");        }        if (denominator < 0) {            numerator = -numerator;            denominator = -denominator;        }        int gcd = greatestCommonDivisor(Math.abs(numerator), denominator);        return new Fraction(numerator / gcd, denominator / gcd);    }