Highest Common Factor of 5190, 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 5190, 9472 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 5190, 9472 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 5190, 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 5190, 9472 is 2.
HCF(5190, 9472) = 2
HCF of 5190, 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 5190, 9472 is 2.
Highest Common Factor of 5190,9472 is 2
Step 1: Since 9472 > 5190, we apply the division lemma to 9472 and 5190, to get
9472 = 5190 x 1 + 4282
Step 2: Since the reminder 5190 ≠ 0, we apply division lemma to 4282 and 5190, to get
5190 = 4282 x 1 + 908
Step 3: We consider the new divisor 4282 and the new remainder 908, and apply the division lemma to get
4282 = 908 x 4 + 650
We consider the new divisor 908 and the new remainder 650,and apply the division lemma to get
908 = 650 x 1 + 258
We consider the new divisor 650 and the new remainder 258,and apply the division lemma to get
650 = 258 x 2 + 134
We consider the new divisor 258 and the new remainder 134,and apply the division lemma to get
258 = 134 x 1 + 124
We consider the new divisor 134 and the new remainder 124,and apply the division lemma to get
134 = 124 x 1 + 10
We consider the new divisor 124 and the new remainder 10,and apply the division lemma to get
124 = 10 x 12 + 4
We consider the new divisor 10 and the new remainder 4,and apply the division lemma to get
10 = 4 x 2 + 2
We consider the new divisor 4 and the new remainder 2,and apply the division lemma to get
4 = 2 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 5190 and 9472 is 2
Notice that 2 = HCF(4,2) = HCF(10,4) = HCF(124,10) = HCF(134,124) = HCF(258,134) = HCF(650,258) = HCF(908,650) = HCF(4282,908) = HCF(5190,4282) = HCF(9472,5190) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 5190, 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 5190, 9472?
Answer: HCF of 5190, 9472 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5190, 9472 using Euclid's Algorithm?
Answer: For arbitrary numbers 5190, 9472 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.