Highest Common Factor of 963, 612, 789 using Euclid's algorithm
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 963, 612, 789 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 963, 612, 789 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 963, 612, 789 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 963, 612, 789 is 3.
HCF(963, 612, 789) = 3
HCF of 963, 612, 789 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 963, 612, 789 is 3.
Highest Common Factor of 963,612,789 is 3
Step 1: Since 963 > 612, we apply the division lemma to 963 and 612, to get
963 = 612 x 1 + 351
Step 2: Since the reminder 612 ≠ 0, we apply division lemma to 351 and 612, to get
612 = 351 x 1 + 261
Step 3: We consider the new divisor 351 and the new remainder 261, and apply the division lemma to get
351 = 261 x 1 + 90
We consider the new divisor 261 and the new remainder 90,and apply the division lemma to get
261 = 90 x 2 + 81
We consider the new divisor 90 and the new remainder 81,and apply the division lemma to get
90 = 81 x 1 + 9
We consider the new divisor 81 and the new remainder 9,and apply the division lemma to get
81 = 9 x 9 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 9, the HCF of 963 and 612 is 9
Notice that 9 = HCF(81,9) = HCF(90,81) = HCF(261,90) = HCF(351,261) = HCF(612,351) = HCF(963,612) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 789 > 9, we apply the division lemma to 789 and 9, to get
789 = 9 x 87 + 6
Step 2: Since the reminder 9 ≠ 0, we apply division lemma to 6 and 9, to get
9 = 6 x 1 + 3
Step 3: We consider the new divisor 6 and the new remainder 3, and apply the division lemma to get
6 = 3 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 9 and 789 is 3
Notice that 3 = HCF(6,3) = HCF(9,6) = HCF(789,9) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 963, 612, 789 using Euclid's Algorithm
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 963, 612, 789?
Answer: HCF of 963, 612, 789 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 963, 612, 789 using Euclid's Algorithm?
Answer: For arbitrary numbers 963, 612, 789 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.