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