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