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