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