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