In this video, the Euclidean algorithm is introduced as a method for finding the greatest common factor of two numbers. The presentation specifically demonstrates the subtraction version of the algorithm rather than the modulo version.
Conditions: Applies to two numbers in the worked example.; The video uses positive integer examples.
In this video, the Euclidean algorithm is introduced as a method for finding the greatest common factor of two numbers. The presentation specifically demonstrates the subtraction version of the algorithm rather than the modulo version.
Conditions: Applies to two numbers in the worked example.; The video uses positive integer examples.
Yes, in this context, "greatest common factor" is being used for what is more commonly called the greatest common divisor in many modern texts. The mathematical procedure shown is the same subtraction-based Euclidean algorithm.
Conditions: Used informally in the explanation of why the algorithm works.
Yes, in this context, "greatest common factor" is being used for what is more commonly called the greatest common divisor in many modern texts. The mathematical procedure shown is the same subtraction-based Euclidean algorithm.
Conditions: Used informally in the explanation of why the algorithm works.