## How to find the Greatest Common Factor of 14 and 26?

There are many methods we can apply to calculate the GCF of 14 and 26.

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

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

These are the numbers that divide the 14 and 26 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 14 and 26.

#### Methods of calculating the GCF of 14 and 26:

### Method 1 - Prime Factorisation

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

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

##### Prime factors of 14:

As you can see below, the prime factors of **14** are **2 and 7**.

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

**14** = 2^{1}x7^{1}

##### Prime factors of 26:

As you can see below, the prime factors of **26** are **2 and 13**.

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

**26** = 2^{1}x13^{1}

#### Step 2: Write down a list of all the common prime factors of 14 and 26:

As seen in the boxes above, the common prime factors of 14 and 26 are **2**.

#### 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:

2^{1}=**2**

##### Done!

According to our calculations above, the **Greatest Common Factor** of 14 and 26 is **2**

### Method 2 - List of Factors

With this simple method, we'll need to find all the factors of 14 and 26, 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 14 and 26 without a remainder:

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

**1, 2, 7 and 14**.

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

**1, 2, 13 and 26**.

#### 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 14 and 26, we have highlighted the number **2**, which means that we have found the Greatest Common Factor, or GCF.

According to our calculations above, the **Greatest Common Factor of **14 and 26 is **2**

### Method 3 - Euclidean algorithm

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

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:

14, 26

#### Step 2

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

The remaining set is: 26

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

26 mod 14 = 12

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

12, 14

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

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

The remaining set is: 14

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

14 mod 12 = 2

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

2, 12

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

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

The remaining set is: 12

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

12 mod 2 = 0

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

2

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

The **Greatest Common Factor of **14 and 26 is **2**

### 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: 14, 26

#### Step 2: All of the numbers are even.

Divide all of them by 2 and multiply your GCF by 2.

Remove the duplicates and sort.

Repeat the process if all the numbers are even:

The resulting list: 7, 13

GCF = 1*2 = 2

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

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

Remove the duplicates and sort:

(13-7)/2 = 3

The resulting list: 3, 7

#### 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:

(7-3)/2 = 2

The resulting list: 2, 3

#### 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:

2/2 = 1

The resulting list: 1, 3

#### Step 6: Pick the first number, 1.

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

Remove the duplicates and sort:

(3-1)/2 = 1

The resulting list: 1

#### Step 7: Only one number remains, 1.

Multiply it by your current GCF:

GCF = 2*1 = 2

The **Greatest Common Factor of **14 and 26 is **2**