Highest Common Factor of 789, 9165 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 789, 9165 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 789, 9165 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 789, 9165 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 789, 9165 is 3.
HCF(789, 9165) = 3
HCF of 789, 9165 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 789, 9165 is 3.
Highest Common Factor of 789,9165 is 3
Step 1: Since 9165 > 789, we apply the division lemma to 9165 and 789, to get
9165 = 789 x 11 + 486
Step 2: Since the reminder 789 ≠ 0, we apply division lemma to 486 and 789, to get
789 = 486 x 1 + 303
Step 3: We consider the new divisor 486 and the new remainder 303, and apply the division lemma to get
486 = 303 x 1 + 183
We consider the new divisor 303 and the new remainder 183,and apply the division lemma to get
303 = 183 x 1 + 120
We consider the new divisor 183 and the new remainder 120,and apply the division lemma to get
183 = 120 x 1 + 63
We consider the new divisor 120 and the new remainder 63,and apply the division lemma to get
120 = 63 x 1 + 57
We consider the new divisor 63 and the new remainder 57,and apply the division lemma to get
63 = 57 x 1 + 6
We consider the new divisor 57 and the new remainder 6,and apply the division lemma to get
57 = 6 x 9 + 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 789 and 9165 is 3
Notice that 3 = HCF(6,3) = HCF(57,6) = HCF(63,57) = HCF(120,63) = HCF(183,120) = HCF(303,183) = HCF(486,303) = HCF(789,486) = HCF(9165,789) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 789, 9165 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 789, 9165?
Answer: HCF of 789, 9165 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 789, 9165 using Euclid's Algorithm?
Answer: For arbitrary numbers 789, 9165 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.