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