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