Highest Common Factor of 3392, 9789 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 3392, 9789 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 3392, 9789 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 3392, 9789 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 3392, 9789 is 1.

HCF(3392, 9789) = 1

HCF of 3392, 9789 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 3392, 9789 is 1.

Highest Common Factor of 3392,9789 using Euclid's algorithm

Highest Common Factor of 3392,9789 is 1

Step 1: Since 9789 > 3392, we apply the division lemma to 9789 and 3392, to get

9789 = 3392 x 2 + 3005

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

3392 = 3005 x 1 + 387

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

3005 = 387 x 7 + 296

We consider the new divisor 387 and the new remainder 296,and apply the division lemma to get

387 = 296 x 1 + 91

We consider the new divisor 296 and the new remainder 91,and apply the division lemma to get

296 = 91 x 3 + 23

We consider the new divisor 91 and the new remainder 23,and apply the division lemma to get

91 = 23 x 3 + 22

We consider the new divisor 23 and the new remainder 22,and apply the division lemma to get

23 = 22 x 1 + 1

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

22 = 1 x 22 + 0

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

Notice that 1 = HCF(22,1) = HCF(23,22) = HCF(91,23) = HCF(296,91) = HCF(387,296) = HCF(3005,387) = HCF(3392,3005) = HCF(9789,3392) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 3392, 9789 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 3392, 9789?

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

3. How to find HCF of 3392, 9789 using Euclid's Algorithm?

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