 ## How to find the Greatest Common Factor of 56 and 62?

There are many methods we can apply to calculate the GCF of 56 and 62.

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

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

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

### Method 1 - Prime Factorisation

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

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

##### Prime factors of 56:

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

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

56 = 23x71

##### Prime factors of 62:

As you can see below, the prime factors of 62 are 2 and 31.

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

62 = 21x311

#### Step 2: Write down a list of all the common prime factors of 56 and 62:

As seen in the boxes above, the common prime factors of 56 and 62 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:

21=2

##### Done!

According to our calculations above, the Greatest Common Factor of 56 and 62 is 2

### Method 2 - List of Factors

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

List of factors that divide 56 without a remainder are:

1, 2, 4, 7, 8, 14, 28 and 56.

List of factors that divide 62 without a remainder are:

1, 2, 31 and 62.

#### 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 56 and 62, 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 56 and 62 is 2

### Method 3 - Euclidean algorithm

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

We follow this procedure until the reminder is 0.

The Greatest Common Divisor is the last nonzero number.

56, 62

#### Step 2

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

The remaining set is: 62

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

62 mod 56 = 6

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

6, 56

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

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

56 mod 6 = 2

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

2, 6

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

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

6 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 56 and 62 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.

The list: 56, 62

#### 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: 28, 31

GCF = 1*2 = 2

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

28/2 = 14

The resulting list: 14, 31

14/2 = 7

The resulting list: 7, 31

#### Step 4: Pick the first number, 7. Subtract 7 from the remaining value(s) and divide the outcome by 2. Remove the duplicates and sort:

(31-7)/2 = 12

The resulting list: 7, 12

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

12/2 = 6

The resulting list: 6, 7

6/2 = 3

The resulting list: 3, 7

#### Step 6: 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 7: 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 8: 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 9: Only one number remains, 1. Multiply it by your current GCF:

GCF = 2*1 = 2

The Greatest Common Factor of 56 and 62 is 2