Preview (may be partial) Activity page that challenges students to use Euclid's algorithm to find the greatest common divisor for pairs of numbers and reduce fractions to lowest terms.Note: This product is a download only product and requires Adobe Acrobat Reader 5.x or later. |
