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