This applet shows a visual illustration of Euclid's Algorithm on a pool table, where after each bounce of the ball, a square is removed from the table. When the remaining table is square, the side of that square is the GCD.[br][br]Press next for the ball to travel to the next wall. Move the sliders to change the dimensions of the rectangle (pressing reset or not). [br][br]Euclid's Algorithm is a way to find the greatest common divisor of two natural numbers by repeated subtraction (division can also be used to group repeated subtractions together). For example, to use Euclid's Algorithm to find GCD(51,21):[br][br]51-21=30[br]30-21=9[br]21-9=12[br]12-9=3[br]9-3=6[br]6-3=3 (since 3 is the last non-zero difference, it is the GCD)[br]3-3=0

How does the pool table picture connect to Euclid's algorithm? Try doing the algorithm with paper and pencil for an example.[br]When is the path of the ball a spiral?[br]Find two or more rectangles where the path of the ball is the same shape, even though the rectangles are different sizes. Generalize.[br]Why does Euclid's algorithm work?