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

HCF of 9851, 5289 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 9851, 5289 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 9851, 5289 is 1.

HCF(9851, 5289) = 1

HCF of 9851, 5289 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 9851, 5289 is 1.

Highest Common Factor of 9851,5289 using Euclid's algorithm

Highest Common Factor of 9851,5289 is 1

Step 1: Since 9851 > 5289, we apply the division lemma to 9851 and 5289, to get

9851 = 5289 x 1 + 4562

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

5289 = 4562 x 1 + 727

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

4562 = 727 x 6 + 200

We consider the new divisor 727 and the new remainder 200,and apply the division lemma to get

727 = 200 x 3 + 127

We consider the new divisor 200 and the new remainder 127,and apply the division lemma to get

200 = 127 x 1 + 73

We consider the new divisor 127 and the new remainder 73,and apply the division lemma to get

127 = 73 x 1 + 54

We consider the new divisor 73 and the new remainder 54,and apply the division lemma to get

73 = 54 x 1 + 19

We consider the new divisor 54 and the new remainder 19,and apply the division lemma to get

54 = 19 x 2 + 16

We consider the new divisor 19 and the new remainder 16,and apply the division lemma to get

19 = 16 x 1 + 3

We consider the new divisor 16 and the new remainder 3,and apply the division lemma to get

16 = 3 x 5 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(16,3) = HCF(19,16) = HCF(54,19) = HCF(73,54) = HCF(127,73) = HCF(200,127) = HCF(727,200) = HCF(4562,727) = HCF(5289,4562) = HCF(9851,5289) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9851, 5289 using Euclid's Algorithm?

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