What would you like to understand?

To compute the greatest common divisor of 1785 and 546, apply the Euclidean algorithm by repeatedly dividing the previous divisor by the previous remainder. Start with 1785 divided by 546.

Conditions: The inputs are 1785 and 546.; The Euclidean algorithm is used.; The division algorithm is applied at each step.

To begin the Euclidean algorithm for $\gcd(1701, 3768)$, place the larger number (3768) on the left side of the division equation and the smaller number (1701) as the divisor. Write $3768 = 1701 \cdot q + r$.

Conditions: The inputs are positive integers.; The larger number is used first on the left-hand side.; The quotient is an integer and the remainder satisfies $0 \le r < 1701$.

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 the step $45 = 10 \cdot 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 \le r < 10$.

The Euclidean algorithm finds the greatest common divisor (GCD) of two integers without needing to factor them. The process involves repeatedly performing long division: divide the larger number by the smaller number, then divide the previous divisor by the remainder, and continue this process.

Conditions: Applies to two integers.; Requires repeated long division.; Stops when the remainder is zero.

The Euclidean algorithm is a method for finding the greatest common divisor (gcd) of two natural numbers. It is set up by repeatedly applying the division algorithm.

Conditions: The inputs $a$ and $b$ are natural numbers.; The division algorithm is used 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.