WEBVTT

1
00:00:00.000 --> 00:00:05.503
Here is the problem: Find the greatest common factor of 17, 51.

2
00:00:05.953 --> 00:00:11.572
Find the greatest common factor (also called GCD or HCF) of the numbers.

3
00:00:12.372 --> 00:00:14.404
Prime factorization of each number.

4
00:00:14.854 --> 00:00:22.331
Euclidean algorithm for GCF(17, 51). 51 equals 3 times 17 plus 0.

5
00:00:22.781 --> 00:00:25.881
The last non-zero remainder is the GCF.

6
00:00:26.331 --> 00:00:33.390
Confirm with shared prime factors. Multiply the primes common to every number, each with its smallest exponent.

7
00:00:34.190 --> 00:00:35.966
So the answer is 17.

8
00:00:36.416 --> 00:00:40.468
17 is the largest whole number that divides every number exactly.

9
00:00:41.268 --> 00:00:44.159
17 divided by 17 equals 1.

10
00:00:44.609 --> 00:00:47.674
51 divided by 17 equals 3.