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