Suppose we want to reduce the fraction 144/276. First we use the Euclidean Algorithm to find the largest divisor of 144 and 276.
Big number | Small number | Remainder |
---|---|---|
276 | 144 | 132 |
144 | 132 | 12 |
132 | 12 | 0 |
Copyright © 2011 - Mathwizz.com all rights reserved