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