Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.
Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).
In this lesson, Prof Loh proved the Euclidean Algorithm for only common factors between the two numbers but not the highest common factor between the two numbers. So how can we prove it is the highest factor?