| |
|
|
|
|
|
|
Euclidean Algorithm |
|
|
We can use Euclid’s Algorithm to find the greatest
common divisor of a pair of integers. In this activity, you will examine how the algorithm works and learn why it is useful. |
|
|
Internet Activity |
|
|
Activity 7.1
Click this link to view your assignment for this activity.
http://go.hrw.com/resources/go_mt/e1/c7/EEUCLID.PDF |
|
|
|
|
|
Adobe Acrobat Reader
You will need Adobe Acrobat Reader to open and print the activity. To download the reader, click "Adobe Acrobat Reader" above.
http://www.adobe.com/products/acrobat/readstep.html |
|
|
Exploration |
|
|
Euclidean Algorithm
This site illustrates the Euclidean Algorithm and explains its significance.
http://mathforum.org/dr.math/problems/vogler3.13.96.html |
|
|
|
|
|
Gabriel Lame
This site contains a brief biography of Gabriel Lame, including an important result he discovered about the Euclidean Algorithm.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Lame.html |
|
|
|
|
|
Euclid’s Game
This site contains an interactive version of Euclid’s Game, which helps to clarify Euclid’s Algorithm. To play the game, click “Reset” to start a new game, click “Please start” to let the computer have the first turn, and enter your number in the white box and hit “Enter” to take your turn.
http://www.cut-the-knot.com/blue/EuclidAlg.html |
|