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