Education Technology

Here's Looking At Euclid

Published on 08/25/2010

Activity Overview

Students first use the familiar prime factorization method to calculate the GCD and LCM of two numbers. Second, they apply Euclid’s algorithm, an iterative process for finding the GCD, in conjunction with a formula for the LCM given the GCD. In order to use the algorithm, they must first grasp the remainder operation, which they explore via a table of values. Lastly, they check their answers with the calculator’s GCD and LCM functions.

Key Steps

  • Image

    Download the attached PDF and look over the information on the first page. Download and distribute the attached TI-Nspire document (.tns file) for use during the activity. A .tns file containing expected student results is also available for download.

  • Image

    Discuss the material from the activity pages with students as needed.

  • Image

    Encourage students to summarize what they have learned from completing the activity.