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