WEBVTT

1
00:00:00.000 --> 00:00:05.515
Here is the problem: Find the greatest common factor of 48, 180.

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

3
00:00:12.013 --> 00:00:13.975
Prime factorization of each number.

4
00:00:14.425 --> 00:00:32.304
Euclidean algorithm for GCF(48, 180). 180 equals 3 times 48 plus 36; 48 equals 1 times 36 plus 12; 36 equals 3 times 12 plus 0.

5
00:00:32.754 --> 00:00:35.796
The last non-zero remainder is the GCF.

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

7
00:00:43.977 --> 00:00:45.533
So the answer is 12.

8
00:00:45.983 --> 00:00:49.733
12 is the largest whole number that divides every number exactly.

9
00:00:50.533 --> 00:00:53.563
48 divided by 12 equals 4.

10
00:00:54.013 --> 00:00:57.484
180 divided by 12 equals 15.