## How to find the Greatest Common Factor of 33 and 39?

There are many methods we can apply to calculate the GCF of 33 and 39.

In our first method, we'll find out the prime factorisation of the 33 and 39 numbers.

In our second method, we'll create a list of all the factors of the 33 and 39 numbers.

These are the numbers that divide the 33 and 39 numbers without a remainder.

Once we have these, all we have to do is to find the one that is the biggest common number from the 2 lists.

Now let's look at each methods, and calculate the GCF of 33 and 39.

#### Methods of calculating the GCF of 33 and 39:

### Method 1 - Prime Factorisation

With the prime factorisation method, all we have to do is to find the common prime factors of 33 and 39, and then multiply them. Really simple:

#### Step 1: Let's create a list of all the prime factors of 33 and 39:

##### Prime factors of 33:

As you can see below, the prime factors of **33** are **3 and 11**.

Let's illustrate the prime factorization of **33** in exponential form:

**33** = 3^{1}x11^{1}

##### Prime factors of 39:

As you can see below, the prime factors of **39** are **3 and 13**.

Let's illustrate the prime factorization of **39** in exponential form:

**39** = 3^{1}x13^{1}

#### Step 2: Write down a list of all the common prime factors of 33 and 39:

As seen in the boxes above, the common prime factors of 33 and 39 are **3**.

#### Step 3: All we have to do now is to multiply these common prime factors:

Find the product of all common prime factors by multiplying them:

3^{1}=**3**

##### Done!

According to our calculations above, the **Greatest Common Factor** of 33 and 39 is **3**

### Method 2 - List of Factors

With this simple method, we'll need to find all the factors of 33 and 39, factors are numbers that divide the another number without a remainder, and simply identify the common ones, then choose which is the largest one.

#### Step 1: Create a list of all the numbers that divide 33 and 39 without a remainder:

List of factors that divide **33** without a remainder are:

**1, 3, 11 and 33**.

List of factors that divide **39** without a remainder are:

**1, 3, 13 and 39**.

#### Step 2: Identify the largest common number from the 2 lists above:

As you can see in the lists of factors from above, for the numbers 33 and 39, we have highlighted the number **3**, which means that we have found the Greatest Common Factor, or GCF.

According to our calculations above, the **Greatest Common Factor of **33 and 39 is **3**

### Method 3 - Euclidean algorithm

The Euclidean algorithm says that if number **k** is the GCM of 33 and 39,
then the number **k** is also the GCM of the division remainder of the numbers 33 and 39.

We follow this procedure until the reminder is 0.

The Greatest Common Divisor is the last nonzero number.

#### Step 1: Sort the numbers into ascending order:

33, 39

#### Step 2

Take out, from the set, the smallers number as you divisor: **33**

The remaining set is: 39

Find the reminder of the division between the number and the divisor

39 mod 33 = 6

Gather the divisor and all of the remainders and sort them in ascending order. Remove any duplicates and 0. Our set is:

6, 33

Repeat the process until there is only one number in the set.

Take out, from the set, the smallers number as you divisor: **6**

The remaining set is: 33

Find the reminder of the division between the number and the divisor

33 mod 6 = 3

Gather the divisor and all of the remainders and sort them in ascending order. Remove any duplicates and 0. Our set is:

3, 6

Repeat the process until there is only one number in the set.

Take out, from the set, the smallers number as you divisor: **3**

The remaining set is: 6

Find the reminder of the division between the number and the divisor

6 mod 3 = 0

Gather the divisor and all of the remainders and sort them in ascending order. Remove any duplicates and 0. Our set is:

3

#### Step 3: Take the remaining number from our set

The **Greatest Common Factor of **33 and 39 is **3**

### Method 4 - Binary Greatest Common Divisor algorithm

The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction.

Although the algorithm in its contemporary form was first published by the Israeli physicist and programmer Josef Stein in 1967, it may have been known by the 2nd century BCE, in ancient China.

#### Step 1: Sort the numbers, and set initial GCF equal to 1

The list: 33, 39

#### Step 2: Pick the first number, 33.

Subtract 33 from the remaining value(s) and divide the outcome by 2.

Remove the duplicates and sort:

(39-33)/2 = 3

The resulting list: 3, 33

#### Step 3: Pick the first number, 3.

Subtract 3 from the remaining value(s) and divide the outcome by 2.

Remove the duplicates and sort:

(33-3)/2 = 15

The resulting list: 3, 15

#### Step 4: Pick the first number, 3.

Subtract 3 from the remaining value(s) and divide the outcome by 2.

Remove the duplicates and sort:

(15-3)/2 = 6

The resulting list: 3, 6

#### Step 5: Divide all of the remaining even values by 2, remove the duplicates and sort.

Repeat the process if there are even numbers in the list:

6/2 = 3

The resulting list: 3

#### Step 6: Only one number remains, 3.

Multiply it by your current GCF:

GCF = 1*3 = 3

The **Greatest Common Factor of **33 and 39 is **3**