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 5428, 9368 i.e. 4 the largest integer that leaves a remainder zero for all numbers.
HCF of 5428, 9368 is 4 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 5428, 9368 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 5428, 9368 is 4.
HCF(5428, 9368) = 4
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5428, 9368 is 4.
Step 1: Since 9368 > 5428, we apply the division lemma to 9368 and 5428, to get
9368 = 5428 x 1 + 3940
Step 2: Since the reminder 5428 ≠ 0, we apply division lemma to 3940 and 5428, to get
5428 = 3940 x 1 + 1488
Step 3: We consider the new divisor 3940 and the new remainder 1488, and apply the division lemma to get
3940 = 1488 x 2 + 964
We consider the new divisor 1488 and the new remainder 964,and apply the division lemma to get
1488 = 964 x 1 + 524
We consider the new divisor 964 and the new remainder 524,and apply the division lemma to get
964 = 524 x 1 + 440
We consider the new divisor 524 and the new remainder 440,and apply the division lemma to get
524 = 440 x 1 + 84
We consider the new divisor 440 and the new remainder 84,and apply the division lemma to get
440 = 84 x 5 + 20
We consider the new divisor 84 and the new remainder 20,and apply the division lemma to get
84 = 20 x 4 + 4
We consider the new divisor 20 and the new remainder 4,and apply the division lemma to get
20 = 4 x 5 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 5428 and 9368 is 4
Notice that 4 = HCF(20,4) = HCF(84,20) = HCF(440,84) = HCF(524,440) = HCF(964,524) = HCF(1488,964) = HCF(3940,1488) = HCF(5428,3940) = HCF(9368,5428) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 5428, 9368?
Answer: HCF of 5428, 9368 is 4 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5428, 9368 using Euclid's Algorithm?
Answer: For arbitrary numbers 5428, 9368 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.