The speaker verbally says "greatest common denominator," but the mathematical notation on the board is "gcd," which conventionally stands for "greatest common divisor." The context of dividing integers to find a common factor confirms that the intended concept is the greatest common divisor, and the spoken word is a verbal slip.
Conditions: The video discusses finding the common factor of two integers.; The board displays the notation gcd(a;b).; The procedure involves repeated integer division.
The speaker verbally says "greatest common denominator," but the mathematical notation on the board is "gcd," which conventionally stands for "greatest common divisor." The context of dividing integers to find a common factor confirms that the intended concept is the greatest common divisor, and the spoken word is a verbal slip.
Conditions: The video discusses finding the common factor of two integers.; The board displays the notation gcd(a;b).; The procedure involves repeated integer division.
In the step 45=10⋅q+r, q represents the quotient, which counts how many whole times the smaller number (10) fits into the larger number (45). r represents the remainder, which is the leftover amount after subtracting those whole multiples.
Conditions: The equation is part of the division-with-remainder step of the Euclidean algorithm.; The inputs are positive integers.; The remainder satisfies 0≤r<10.
In the step 45=10⋅q+r, q represents the quotient, which counts how many whole times the smaller number (10) fits into the larger number (45). r represents the remainder, which is the leftover amount after subtracting those whole multiples.
Conditions: The equation is part of the division-with-remainder step of the Euclidean algorithm.; The inputs are positive integers.; The remainder satisfies 0≤r<10.