Highest Common Factor of 6118, 9849 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 6118, 9849 i.e. 7 the largest integer that leaves a remainder zero for all numbers.
HCF of 6118, 9849 is 7 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 6118, 9849 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 6118, 9849 is 7.
HCF(6118, 9849) = 7
HCF of 6118, 9849 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6118, 9849 is 7.
Highest Common Factor of 6118,9849 is 7
Step 1: Since 9849 > 6118, we apply the division lemma to 9849 and 6118, to get
9849 = 6118 x 1 + 3731
Step 2: Since the reminder 6118 ≠ 0, we apply division lemma to 3731 and 6118, to get
6118 = 3731 x 1 + 2387
Step 3: We consider the new divisor 3731 and the new remainder 2387, and apply the division lemma to get
3731 = 2387 x 1 + 1344
We consider the new divisor 2387 and the new remainder 1344,and apply the division lemma to get
2387 = 1344 x 1 + 1043
We consider the new divisor 1344 and the new remainder 1043,and apply the division lemma to get
1344 = 1043 x 1 + 301
We consider the new divisor 1043 and the new remainder 301,and apply the division lemma to get
1043 = 301 x 3 + 140
We consider the new divisor 301 and the new remainder 140,and apply the division lemma to get
301 = 140 x 2 + 21
We consider the new divisor 140 and the new remainder 21,and apply the division lemma to get
140 = 21 x 6 + 14
We consider the new divisor 21 and the new remainder 14,and apply the division lemma to get
21 = 14 x 1 + 7
We consider the new divisor 14 and the new remainder 7,and apply the division lemma to get
14 = 7 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 7, the HCF of 6118 and 9849 is 7
Notice that 7 = HCF(14,7) = HCF(21,14) = HCF(140,21) = HCF(301,140) = HCF(1043,301) = HCF(1344,1043) = HCF(2387,1344) = HCF(3731,2387) = HCF(6118,3731) = HCF(9849,6118) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 6118, 9849 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 6118, 9849?
Answer: HCF of 6118, 9849 is 7 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6118, 9849 using Euclid's Algorithm?
Answer: For arbitrary numbers 6118, 9849 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.