Highest Common Factor of 5396, 7781 using Euclid's algorithm

Created By : Jatin Gogia

Reviewed By : Rajasekhar Valipishetty

Last Updated : Apr 06, 2023

HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 5396, 7781 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 5396, 7781 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.

Consider we have numbers 5396, 7781 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b

Highest common factor (HCF) of 5396, 7781 is 1.

HCF(5396, 7781) = 1

HCF of 5396, 7781 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 5396, 7781 is 1.

Highest Common Factor of 5396,7781 using Euclid's algorithm

Highest Common Factor of 5396,7781 is 1

Step 1: Since 7781 > 5396, we apply the division lemma to 7781 and 5396, to get

7781 = 5396 x 1 + 2385

Step 2: Since the reminder 5396 ≠ 0, we apply division lemma to 2385 and 5396, to get

5396 = 2385 x 2 + 626

Step 3: We consider the new divisor 2385 and the new remainder 626, and apply the division lemma to get

2385 = 626 x 3 + 507

We consider the new divisor 626 and the new remainder 507,and apply the division lemma to get

626 = 507 x 1 + 119

We consider the new divisor 507 and the new remainder 119,and apply the division lemma to get

507 = 119 x 4 + 31

We consider the new divisor 119 and the new remainder 31,and apply the division lemma to get

119 = 31 x 3 + 26

We consider the new divisor 31 and the new remainder 26,and apply the division lemma to get

31 = 26 x 1 + 5

We consider the new divisor 26 and the new remainder 5,and apply the division lemma to get

26 = 5 x 5 + 1

We consider the new divisor 5 and the new remainder 1,and apply the division lemma to get

5 = 1 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 5396 and 7781 is 1

Notice that 1 = HCF(5,1) = HCF(26,5) = HCF(31,26) = HCF(119,31) = HCF(507,119) = HCF(626,507) = HCF(2385,626) = HCF(5396,2385) = HCF(7781,5396) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 5396, 7781 using Euclid's Algorithm

1. What is the Euclid division algorithm?

Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

2. what is the HCF of 5396, 7781?

Answer: HCF of 5396, 7781 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5396, 7781 using Euclid's Algorithm?

Answer: For arbitrary numbers 5396, 7781 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.