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