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

HCF of 9873, 1772 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 9873, 1772 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 9873, 1772 is 1.

HCF(9873, 1772) = 1

HCF of 9873, 1772 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 9873, 1772 is 1.

Highest Common Factor of 9873,1772 using Euclid's algorithm

Highest Common Factor of 9873,1772 is 1

Step 1: Since 9873 > 1772, we apply the division lemma to 9873 and 1772, to get

9873 = 1772 x 5 + 1013

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

1772 = 1013 x 1 + 759

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

1013 = 759 x 1 + 254

We consider the new divisor 759 and the new remainder 254,and apply the division lemma to get

759 = 254 x 2 + 251

We consider the new divisor 254 and the new remainder 251,and apply the division lemma to get

254 = 251 x 1 + 3

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

251 = 3 x 83 + 2

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

3 = 2 x 1 + 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 9873 and 1772 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(251,3) = HCF(254,251) = HCF(759,254) = HCF(1013,759) = HCF(1772,1013) = HCF(9873,1772) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9873, 1772 using Euclid's Algorithm?

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