Name: Eliana
Who is asking: Student
Question: Hi Eliana, To reduce fractions with large numerators and denominators, it is best to use the euclidian algorithm:
For 599,071/6,163,995 you would find the largest common divisor
of 599,071 and 6,163,995 by taking successive divisions with remainders
as follows: 599,071/173,285 = 3, remainder 79,216 173,285/79,216 = 2, remainder 14,853 79,216/14,853 = 5, remainder 4,951 14,853/4,951 = 3, remainder 0 With your fraction of 79,537/3,623,420, you get a greatest common divisor of 1, which means that the fraction is already in lowest terms. Claude
|