The euclidean algorithm can compute the GCD of the factors of the naive rational form, repeated subtraction (down to zero) of the GCD from the denominator and numerator can be used to find them in their reduced forms.