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 9919, 5380, 35515 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9919, 5380, 35515 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 9919, 5380, 35515 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 9919, 5380, 35515 is 1.
HCF(9919, 5380, 35515) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9919, 5380, 35515 is 1.
Step 1: Since 9919 > 5380, we apply the division lemma to 9919 and 5380, to get
9919 = 5380 x 1 + 4539
Step 2: Since the reminder 5380 ≠ 0, we apply division lemma to 4539 and 5380, to get
5380 = 4539 x 1 + 841
Step 3: We consider the new divisor 4539 and the new remainder 841, and apply the division lemma to get
4539 = 841 x 5 + 334
We consider the new divisor 841 and the new remainder 334,and apply the division lemma to get
841 = 334 x 2 + 173
We consider the new divisor 334 and the new remainder 173,and apply the division lemma to get
334 = 173 x 1 + 161
We consider the new divisor 173 and the new remainder 161,and apply the division lemma to get
173 = 161 x 1 + 12
We consider the new divisor 161 and the new remainder 12,and apply the division lemma to get
161 = 12 x 13 + 5
We consider the new divisor 12 and the new remainder 5,and apply the division lemma to get
12 = 5 x 2 + 2
We consider the new divisor 5 and the new remainder 2,and apply the division lemma to get
5 = 2 x 2 + 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 9919 and 5380 is 1
Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(12,5) = HCF(161,12) = HCF(173,161) = HCF(334,173) = HCF(841,334) = HCF(4539,841) = HCF(5380,4539) = HCF(9919,5380) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 35515 > 1, we apply the division lemma to 35515 and 1, to get
35515 = 1 x 35515 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 35515 is 1
Notice that 1 = HCF(35515,1) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 9919, 5380, 35515?
Answer: HCF of 9919, 5380, 35515 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9919, 5380, 35515 using Euclid's Algorithm?
Answer: For arbitrary numbers 9919, 5380, 35515 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.