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