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