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 9830, 2145 i.e. 5 the largest integer that leaves a remainder zero for all numbers.
HCF of 9830, 2145 is 5 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 9830, 2145 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 9830, 2145 is 5.
HCF(9830, 2145) = 5
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9830, 2145 is 5.
Step 1: Since 9830 > 2145, we apply the division lemma to 9830 and 2145, to get
9830 = 2145 x 4 + 1250
Step 2: Since the reminder 2145 ≠ 0, we apply division lemma to 1250 and 2145, to get
2145 = 1250 x 1 + 895
Step 3: We consider the new divisor 1250 and the new remainder 895, and apply the division lemma to get
1250 = 895 x 1 + 355
We consider the new divisor 895 and the new remainder 355,and apply the division lemma to get
895 = 355 x 2 + 185
We consider the new divisor 355 and the new remainder 185,and apply the division lemma to get
355 = 185 x 1 + 170
We consider the new divisor 185 and the new remainder 170,and apply the division lemma to get
185 = 170 x 1 + 15
We consider the new divisor 170 and the new remainder 15,and apply the division lemma to get
170 = 15 x 11 + 5
We consider the new divisor 15 and the new remainder 5,and apply the division lemma to get
15 = 5 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 5, the HCF of 9830 and 2145 is 5
Notice that 5 = HCF(15,5) = HCF(170,15) = HCF(185,170) = HCF(355,185) = HCF(895,355) = HCF(1250,895) = HCF(2145,1250) = HCF(9830,2145) .
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 9830, 2145?
Answer: HCF of 9830, 2145 is 5 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9830, 2145 using Euclid's Algorithm?
Answer: For arbitrary numbers 9830, 2145 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.