Highest Common Factor of 2392, 6412, 91782 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 2392, 6412, 91782 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 2392, 6412, 91782 is 2 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 2392, 6412, 91782 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 2392, 6412, 91782 is 2.

HCF(2392, 6412, 91782) = 2

HCF of 2392, 6412, 91782 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 2392, 6412, 91782 is 2.

Highest Common Factor of 2392,6412,91782 using Euclid's algorithm

Highest Common Factor of 2392,6412,91782 is 2

Step 1: Since 6412 > 2392, we apply the division lemma to 6412 and 2392, to get

6412 = 2392 x 2 + 1628

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

2392 = 1628 x 1 + 764

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

1628 = 764 x 2 + 100

We consider the new divisor 764 and the new remainder 100,and apply the division lemma to get

764 = 100 x 7 + 64

We consider the new divisor 100 and the new remainder 64,and apply the division lemma to get

100 = 64 x 1 + 36

We consider the new divisor 64 and the new remainder 36,and apply the division lemma to get

64 = 36 x 1 + 28

We consider the new divisor 36 and the new remainder 28,and apply the division lemma to get

36 = 28 x 1 + 8

We consider the new divisor 28 and the new remainder 8,and apply the division lemma to get

28 = 8 x 3 + 4

We consider the new divisor 8 and the new remainder 4,and apply the division lemma to get

8 = 4 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 2392 and 6412 is 4

Notice that 4 = HCF(8,4) = HCF(28,8) = HCF(36,28) = HCF(64,36) = HCF(100,64) = HCF(764,100) = HCF(1628,764) = HCF(2392,1628) = HCF(6412,2392) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 91782 > 4, we apply the division lemma to 91782 and 4, to get

91782 = 4 x 22945 + 2

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

4 = 2 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 4 and 91782 is 2

Notice that 2 = HCF(4,2) = HCF(91782,4) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 2392, 6412, 91782 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 2392, 6412, 91782?

Answer: HCF of 2392, 6412, 91782 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2392, 6412, 91782 using Euclid's Algorithm?

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