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