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