WEBVTT

1
00:00:00.000 --> 00:00:05.213
Here is the problem: Find the greatest common factor of 64, 96.

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

3
00:00:11.722 --> 00:00:13.673
Prime factorization of each number.

4
00:00:14.123 --> 00:00:26.731
Euclidean algorithm for GCF(64, 96). 96 equals 1 times 64 plus 32; 64 equals 2 times 32 plus 0.

5
00:00:27.181 --> 00:00:30.223
The last non-zero remainder is the GCF.

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

7
00:00:38.276 --> 00:00:40.250
So the answer is 32.

8
00:00:40.700 --> 00:00:44.822
32 is the largest whole number that divides every number exactly.

9
00:00:45.621 --> 00:00:48.872
64 divided by 32 equals 2.

10
00:00:49.322 --> 00:00:52.457
96 divided by 32 equals 3.