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

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

HCF(6404, 9789) = 1

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

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

Highest Common Factor of 6404,9789 is 1

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

9789 = 6404 x 1 + 3385

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

6404 = 3385 x 1 + 3019

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

3385 = 3019 x 1 + 366

We consider the new divisor 3019 and the new remainder 366,and apply the division lemma to get

3019 = 366 x 8 + 91

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

366 = 91 x 4 + 2

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

91 = 2 x 45 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(91,2) = HCF(366,91) = HCF(3019,366) = HCF(3385,3019) = HCF(6404,3385) = HCF(9789,6404) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

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

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