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