eHowEducation · YouTube · 1:34
This 94-second introductory clip explains the subtraction form of the Euclidean algorithm for finding the greatest common factor. After a brief title and self-introduction, the presenter works the example 12 and 8 on a transparent board: he subtracts the smaller number from the larger one to get 4, repeats the process with 8 and 4, and obtains 4 again, identifying 4 as the greatest common factor. He then gives an informal reason for correctness: a greatest common factor divides evenly, division is treated as repeated subtraction, and therefore the same divisor must also divide the difference produced by one subtraction step. The clip closes with branding and credits. The mathematics is clear but elementary and example-based rather than fully formal.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The speaker opens by naming the topic: why the Euclidean algorithm works. He frames the algorithm as a tool for finding the greatest common factor, establishing the goal before any computation begins.
He introduces the concrete example 12 and 8. The board then records the first subtraction step, , matching his spoken rule that the smaller number is subtracted from the larger number.
The process is repeated on the new pair 8 and 4. The board shows , and the speaker identifies the final value 4 as the greatest common factor of the original pair.
After finishing the example, he shifts from computation to justification. He describes the greatest common factor informally as a number that divides evenly, then interprets division as repeated subtraction.
Using the written example as reference, he argues that if a divisor subtracts evenly from the larger number down to the smaller number, then the leftover difference must also be divisible by that same number. This is the clip’s main intuitive reason for why the Euclidean subtraction step preserves the common factor.
He closes by restating that this divisibility-preservation idea is why the Euclidean algorithm works. The ending is explanatory rather than formal, relying on the example 12 and 8 and on the repeated-subtraction interpretation of divisibility.
The video introduces the Euclidean algorithm as a method for finding the greatest common factor of two numbers. The presentation uses the subtraction version of the algorithm rather than the modulo version.
The worked rule is: keep the smaller number, subtract it from the larger number, and repeat. On the board this becomes , then , and the final value 4 is identified as the greatest common factor.
The speaker describes the greatest common factor as a number that divides evenly. This is an informal verbal definition tied to the example rather than a formal statement about maximal common divisors.
The key intuition is that division is treated as repeated subtraction. If a common divisor subtracts evenly, then after replacing the larger number by the difference, that same divisor still divides the difference evenly. This is the reason the clip gives for why the Euclidean algorithm works.
The clip uses the older phrase greatest common factor where many modern texts say greatest common divisor. It also gives only the intuitive one-way divisibility preservation step; a full formal proof usually also discusses that the common divisors of (a,b) and (a-b,b) match in both directions.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The speaker says, "Let's say we have two numbers, 12 and 8," and later states, "the greatest common factor is 4."
The board shows the pair 12 and 8, then the subtraction steps 12-8 and 8-4, ending with 4.
12, 8, 4
Concrete example values used to demonstrate the Euclidean algorithm and its result.
Positive integers.
The speaker explains, "we keep the smaller number and subtract it from the larger number."
The written expressions are 12-8 and 8-4.
a-b
One Euclidean subtraction step: replace the larger number by the difference after subtracting the smaller number.
Used here for positive integers with .
The speaker says, "when you think of the greatest common factor, it's a number that divides evenly" and "it subtracts evenly."
The phrase "divides evenly" is informal; the video does not write a formal divisibility notation such as .
divides evenly / subtracts evenly
Informal spoken description of divisibility: a number can be subtracted repeatedly without leaving a remainder.
Integers in the example context.
"This algorithm is used to find the greatest common factor."
In this clip, the Euclidean algorithm is introduced as a method for finding the greatest common factor of two numbers. The presentation uses the subtraction version rather than the modulo version.
Applies to two numbers in the worked example.
The video uses positive integer examples.
"we keep the smaller number and subtract it from the larger number" and "We repeat the process."
The board records 12-8 -> 4 and then 8-4 -> 4.
The demonstrated procedure keeps the smaller number, subtracts it from the larger number, replaces the larger number with the difference, and repeats until the desired stopping value is reached.
The video explicitly applies this to the pair 12 and 8.
It assumes one chooses the larger and smaller number at each step.
"when you think of the greatest common factor, it's a number that divides evenly"
The speaker gives an informal description rather than a full formal definition involving maximality among common divisors.
The greatest common factor is described verbally as a number that divides evenly. In context, this means a shared divisor of the numbers under consideration.
Used informally in the explanation of why the algorithm works.
"we know that division is multiple subtractions, so it subtracts evenly"
This is a conceptual explanation, not a formal theorem statement.
The speaker explains divisibility by saying that division is multiple subtractions. This is used to justify why a common divisor also divides the difference produced by one subtraction step.
Applied to whole-number divisibility in the example.
"once it subtracts into the smaller number evenly, we're left with the difference ... we know that it has to go into that difference evenly."
The claim is stated informally and only illustrated with 8 and 12; the general symbolic form is not written on screen.
If a number divides the smaller number evenly, then after subtracting it repeatedly from the larger number, it also divides the resulting difference evenly.
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.
Stated informally for the example pair and presented as the reason the algorithm works in general.
"So now we have our answer, the greatest common factor is 4" and "So this is why the Euclidean algorithm works."
The proof is intuitive and example-based rather than fully formal.
The subtraction-based Euclidean algorithm shown in the clip yields the greatest common factor of the two starting numbers.
Start with two numbers, illustrated by 12 and 8.
Repeatedly subtract the smaller from the larger.
Use the idea that a common divisor divides differences evenly.
Presented as a general explanation, but justified in the clip mainly through the example 12 and 8.
The speaker narrates each subtraction step and concludes, "the greatest common factor is 4."
The board shows 12 and 8, then 12-8, then 4, then 8-4, then 4.
Start with the two given numbers.
Directly stated in the audio and written on the board.
Subtract the smaller number from the larger number.
This is the subtraction rule the speaker states for the algorithm.
Keep the smaller number and pair it with the new difference.
The speaker says, "We repeat the process."
Subtract again to obtain the next difference.
Same subtraction rule applied to the new pair.
The process stops with 4, identified as the greatest common factor.
The speaker explicitly says, "the greatest common factor is 4."
For the example pair 12 and 8, the subtraction-based Euclidean algorithm ends at 4, which the video identifies as the greatest common factor.
The speaker explains that a greatest common factor divides evenly, that division is multiple subtractions, and that the divisor must go into the difference evenly.
The argument is verbal and intuitive; no formal algebraic proof is written on screen.
Begin with the idea that the greatest common factor is a number that divides evenly.
Stated verbally by the speaker.
Interpret divisibility as repeated subtraction without remainder.
The speaker explicitly says, "division is multiple subtractions."
After subtracting the smaller number from the larger one, the result is the difference.
This matches the worked example and the spoken explanation.
Because the same divisor subtracts evenly, it also goes into the difference evenly.
This is the speaker’s informal key step explaining why the algorithm works.
The clip’s explanation is that a common divisor remains a divisor of the difference produced by one Euclidean subtraction step, which is why repeating the subtraction process still leads to the greatest common factor.
"Let's say we have two numbers, 12 and 8 ... the greatest common factor is 4."
The board displays 12, 8, 12-8, 4, 8-4, 4.
Use the subtraction version of the Euclidean algorithm to find the greatest common factor of 12 and 8.
The two numbers are 12 and 8.
At each step, keep the smaller number and subtract it from the larger number.
Determine the greatest common factor.
Subtract the smaller number from the larger number.
This is the rule stated for the algorithm.
Repeat the process with the new pair 8 and 4.
The speaker says to repeat the process until the answer is obtained.
The final value reached is identified as the greatest common factor.
The speaker explicitly states, "the greatest common factor is 4."
4
The video verifies the result by ending the subtraction process at 4 and verbally identifying that value as the greatest common factor.
The presenter writes on a transparent board while facing the camera.
The visible writing progresses from 12 and 8 to 12-8, then 4, then 8-4, then another 4.
Presenter
transparent board
marker
numbers 12, 8, 4
subtraction expressions 12-8 and 8-4
First the pair 12 and 8 is written.
Then the expression 12-8 is added and simplified to 4.
Then the next subtraction 8-4 is written and simplified to 4.
The final board state shows the completed example ending in 4.
The example stays focused on the same two starting numbers, 12 and 8.
The method shown remains subtraction of the smaller number from the larger number.
The visual sequence tracks the algorithm step by step, making the replacement of the larger number by the difference explicit.
While explaining why the method works, the presenter gestures toward the written numbers and subtraction results.
Exact finger positions are not always clear from the sampled frames.
Written numbers 12, 8, 4
presenter’s hand and marker
The presenter points between the original numbers and the computed differences while speaking about even subtraction and the difference.
The board content remains the completed example from the earlier calculation.
The gestures connect the abstract claim about divisibility to the concrete example already written on the board.
The speaker repeatedly uses "greatest common factor" while explaining divisibility.
Learners may treat "factor" and "divisor" as unrelated terms or may not notice that the clip uses the older phrase "greatest common factor."
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.
The speaker emphasizes that a divisor of the smaller number also divides the difference evenly.
The video does not explicitly discuss the converse preservation of common divisors.
Viewers might infer that the spoken argument alone proves the whole correctness of the Euclidean algorithm.
The video gives the intuitive key step that a common divisor divides the difference. A full formal proof usually also notes that the set of common divisors of (a,b) and (a-b,b) is the same in both directions. That extra detail is not stated in the clip.
The speaker first names the purpose of the algorithm and then immediately demonstrates the subtraction rule on 12 and 8.
The stated purpose of finding the greatest common factor is carried out by the subtraction rule demonstrated on the example.
The board shows the rule being applied as 12-8 and then 8-4.
The worked example is a direct application of the subtraction rule.
The speaker defines the greatest common factor informally as a number that divides evenly, then says division is multiple subtractions.
The explanation of why the algorithm works depends on interpreting divisibility through repeated subtraction.
The repeated-subtraction idea is used to argue that the divisor goes into the difference evenly.
The proposition that a common divisor also divides the difference is justified by the speaker’s repeated-subtraction interpretation of divisibility.
After explaining the difference step, the speaker concludes, "So this is why the Euclidean algorithm works."
The conclusion is intuitive rather than fully formal.
The clip presents the preservation of divisibility under subtraction as the main reason the Euclidean algorithm returns the greatest common factor.
"This algorithm is used to find the greatest common factor."
"we keep the smaller number and subtract it from the larger number" and "We repeat the process."
The board shows and .
"division is multiple subtractions" and "it has to go into that difference evenly"
The speaker uses "greatest common factor" throughout.
Covered · Intro logo and music; no mathematical content.
Covered · Speaker introduces himself and states that the Euclidean algorithm is used to find the greatest common factor.
Covered · Worked subtraction example on 12 and 8, ending with 4 as the greatest common factor.
Covered · Informal explanation of why the subtraction method preserves divisibility and therefore why the algorithm works.
Covered · Outro graphics and credits; no mathematical content.
From 14 to 84 seconds, the source computes and , then explains that a common divisor divides the difference. The reviewed material explicitly states that the converse preservation step is absent, so this is not classified as a complete proof.
From 14 to 44 seconds, the board correctly shows and , ending with the greatest common factor 4.
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.
The example ends with 4 because applying the subtraction rule repeatedly yields 4 as the final value. First, , creating the pair 8 and 4.
Conditions: Start with the pair 12 and 8.; Repeatedly subtract the smaller from the larger.
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.
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.
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.
YouTube2:43Another application of Greatest common divisor.
Greatest common divisor
YouTube4:25Another application of Greatest common divisor.
Greatest common divisor
YouTube2:03Another application of Greatest common divisor.
Greatest common divisorYouTube2:43Next in Discrete Mathematics: Counting and Number Theory: Greatest common divisor → Euclidean algorithm.
Euclidean algorithm · View learning sequencePrerequisite in Discrete Mathematics: Counting and Number Theory: Greatest common divisor → Euclidean algorithm.
Greatest common divisor · View learning sequenceYouTube2:03Next in Discrete Mathematics: Counting and Number Theory: Greatest common divisor → Euclidean algorithm.
Euclidean algorithm · View learning sequencePrerequisite in Discrete Mathematics: Counting and Number Theory: Greatest common divisor → Euclidean algorithm.
Greatest common divisor · View learning sequence
YouTube5:01Next in Discrete Mathematics: Counting and Number Theory: Greatest common divisor → Euclidean algorithm.
Euclidean algorithm · View learning sequencePrerequisite in Discrete Mathematics: Counting and Number Theory: Greatest common divisor → Euclidean algorithm.
Greatest common divisor · View learning sequenceYouTube2:03Application of Euclidean algorithm, complementing the current explanation.
Euclidean algorithmVisual explanation for Greatest common divisor, compared with the current whiteboard.
Greatest common divisorYouTube5:01Visual explanation for Euclidean algorithm, compared with the current whiteboard.
Euclidean algorithmApplication of Euclidean algorithm, complementing the current explanation.
Euclidean algorithmExplanation of Greatest common divisor, complementing the current application.
Greatest common divisor
YouTube4:09Problem solving for Greatest common divisor, compared with the current whiteboard.
Greatest common divisorApplication of Euclidean algorithm, complementing the current explanation.
Euclidean algorithm