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

HCF of 6104, 9847 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 6104, 9847 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 6104, 9847 is 1.

HCF(6104, 9847) = 1

HCF of 6104, 9847 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 6104, 9847 is 1.

Highest Common Factor of 6104,9847 using Euclid's algorithm

Highest Common Factor of 6104,9847 is 1

Step 1: Since 9847 > 6104, we apply the division lemma to 9847 and 6104, to get

9847 = 6104 x 1 + 3743

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

6104 = 3743 x 1 + 2361

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

3743 = 2361 x 1 + 1382

We consider the new divisor 2361 and the new remainder 1382,and apply the division lemma to get

2361 = 1382 x 1 + 979

We consider the new divisor 1382 and the new remainder 979,and apply the division lemma to get

1382 = 979 x 1 + 403

We consider the new divisor 979 and the new remainder 403,and apply the division lemma to get

979 = 403 x 2 + 173

We consider the new divisor 403 and the new remainder 173,and apply the division lemma to get

403 = 173 x 2 + 57

We consider the new divisor 173 and the new remainder 57,and apply the division lemma to get

173 = 57 x 3 + 2

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

57 = 2 x 28 + 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 6104 and 9847 is 1

Notice that 1 = HCF(2,1) = HCF(57,2) = HCF(173,57) = HCF(403,173) = HCF(979,403) = HCF(1382,979) = HCF(2361,1382) = HCF(3743,2361) = HCF(6104,3743) = HCF(9847,6104) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 6104, 9847 using Euclid's Algorithm?

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