Home | Fractions menu | Contest

---

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

So 12 is the largest divisor of 144 and 276.

So 144/276 reduces to 12/23.