Microcomputer-assisted Discoveries: Euclidean Algorithm and Continued Fractions
Clark H. Kimberling · Mathematics Teacher Learning and Teaching PK-12 · 1983
Students can use microcomputers to cut through algorithms and computations to gain mathematical insights. This approach is especially true for the Euclidean algorithm, so often used to find the greatest common divisor (GCD) of two positive integers. The Euclidean algorithm also yields continued fractions, at least far enough for students to find patterns and discover truths about numbers.