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 |

What is a fraction?

Adding fractions

Subtracting fractions

Multiplying fractions

Dividing fractions

Subtracting a fraction from a whole number

Multiplying a fraction and a whole number

Dividing a fraction and a whole number

What is a reciprocal?

Changing a fraction to a percentage

Changing a percentage to a fraction

Rounding to a whole number

Finding the lowest common denominator

Reducing a fraction

Euclidean Algorithm

Adding fractions

Subtracting fractions

Multiplying fractions

Dividing fractions

Subtracting a fraction from a whole number

Multiplying a fraction and a whole number

Dividing a fraction and a whole number

What is a reciprocal?

Changing a fraction to a percentage

Changing a percentage to a fraction

Rounding to a whole number

Finding the lowest common denominator

Reducing a fraction

Euclidean Algorithm

Copyright © 2011 - Mathwizz.com all rights reserved