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

HCF of 9903, 6380 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 9903, 6380 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 9903, 6380 is 1.

HCF(9903, 6380) = 1

HCF of 9903, 6380 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 9903, 6380 is 1.

Highest Common Factor of 9903,6380 using Euclid's algorithm

Highest Common Factor of 9903,6380 is 1

Step 1: Since 9903 > 6380, we apply the division lemma to 9903 and 6380, to get

9903 = 6380 x 1 + 3523

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

6380 = 3523 x 1 + 2857

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

3523 = 2857 x 1 + 666

We consider the new divisor 2857 and the new remainder 666,and apply the division lemma to get

2857 = 666 x 4 + 193

We consider the new divisor 666 and the new remainder 193,and apply the division lemma to get

666 = 193 x 3 + 87

We consider the new divisor 193 and the new remainder 87,and apply the division lemma to get

193 = 87 x 2 + 19

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

87 = 19 x 4 + 11

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

19 = 11 x 1 + 8

We consider the new divisor 11 and the new remainder 8,and apply the division lemma to get

11 = 8 x 1 + 3

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

8 = 3 x 2 + 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 9903 and 6380 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(8,3) = HCF(11,8) = HCF(19,11) = HCF(87,19) = HCF(193,87) = HCF(666,193) = HCF(2857,666) = HCF(3523,2857) = HCF(6380,3523) = HCF(9903,6380) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9903, 6380 using Euclid's Algorithm?

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