Skip to content
START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

← Concept directory

Answers for “为什么在欧几里得算法中,公因数也能整除差?”

4 keyword matches

Understanding your question. You can explore the search results below now.

Understand why

↗

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.

Meet the concept

↗

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.

Understand why

↗

The example ends with 4 because applying the subtraction rule repeatedly yields 4 as the final value. First, 12−8=412 - 8 = 4, creating the pair 8 and 4.

Conditions: Start with the pair 12 and 8.; Repeatedly subtract the smaller from the larger.

Find a method

↗

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.