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