To perform each step, you keep the smaller number and subtract it from the larger number. You then replace the larger number with the resulting difference and repeat the process until the desired stopping value is reached.
Conditions: The video explicitly applies this to the pair 12 and 8.; It assumes one chooses the larger and smaller number at each step.
To perform each step, you keep the smaller number and subtract it from the larger number. You then replace the larger number with the resulting difference and repeat the process until the desired stopping value is reached.
Conditions: The video explicitly applies this to the pair 12 and 8.; It assumes one chooses the larger and smaller number at each step.
A common divisor also divides the difference because division is interpreted as repeated subtraction. If a number divides evenly into the larger number and the smaller number, subtracting the smaller number repeatedly from the larger one will eventually leave a difference that the same divisor also divides evenly.
Conditions: There are two numbers in the example.; A chosen divisor divides evenly in the sense described by the speaker.; The subtraction is performed from the larger number using the smaller number.
A common divisor also divides the difference because division is interpreted as repeated subtraction. If a number divides evenly into the larger number and the smaller number, subtracting the smaller number repeatedly from the larger one will eventually leave a difference that the same divisor also divides evenly.
Conditions: There are two numbers in the example.; A chosen divisor divides evenly in the sense described by the speaker.; The subtraction is performed from the larger number using the smaller number.
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.