to reduce a rational number to its lowest terms, you first compute the greatest common divisor (gcd) of the numerator and the denominator, using euclid's algorithm.