WEBVTT

1
00:00:00.000 --> 00:00:05.840
Here is the problem: Find the greatest common factor of 24, 36, 60.

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

3
00:00:12.651 --> 00:00:14.613
Prime factorization of each number.

4
00:00:15.063 --> 00:00:26.301
Euclidean algorithm for GCF(24, 36). 36 equals 1 times 24 plus 12; 24 equals 2 times 12 plus 0.

5
00:00:26.751 --> 00:00:29.804
The last non-zero remainder is the GCF.

6
00:00:30.254 --> 00:00:36.872
Euclidean algorithm for GCF(12, 60). 60 equals 5 times 12 plus 0.

7
00:00:37.672 --> 00:00:40.702
The last non-zero remainder is the GCF.

8
00:00:41.152 --> 00:00:47.921
Confirm with shared prime factors. Multiply the primes common to every number, each with its smallest exponent.

9
00:00:48.721 --> 00:00:50.207
So the answer is 12.

10
00:00:50.657 --> 00:00:54.488
12 is the largest whole number that divides every number exactly.

11
00:00:55.288 --> 00:00:58.109
24 divided by 12 equals 2.

12
00:00:58.559 --> 00:01:01.427
36 divided by 12 equals 3.

13
00:01:01.877 --> 00:01:04.652
60 divided by 12 equals 5.