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