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