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 5248, 6436, 73045 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 5248, 6436, 73045 is 1 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 5248, 6436, 73045 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 5248, 6436, 73045 is 1.
HCF(5248, 6436, 73045) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5248, 6436, 73045 is 1.
Step 1: Since 6436 > 5248, we apply the division lemma to 6436 and 5248, to get
6436 = 5248 x 1 + 1188
Step 2: Since the reminder 5248 ≠ 0, we apply division lemma to 1188 and 5248, to get
5248 = 1188 x 4 + 496
Step 3: We consider the new divisor 1188 and the new remainder 496, and apply the division lemma to get
1188 = 496 x 2 + 196
We consider the new divisor 496 and the new remainder 196,and apply the division lemma to get
496 = 196 x 2 + 104
We consider the new divisor 196 and the new remainder 104,and apply the division lemma to get
196 = 104 x 1 + 92
We consider the new divisor 104 and the new remainder 92,and apply the division lemma to get
104 = 92 x 1 + 12
We consider the new divisor 92 and the new remainder 12,and apply the division lemma to get
92 = 12 x 7 + 8
We consider the new divisor 12 and the new remainder 8,and apply the division lemma to get
12 = 8 x 1 + 4
We consider the new divisor 8 and the new remainder 4,and apply the division lemma to get
8 = 4 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 5248 and 6436 is 4
Notice that 4 = HCF(8,4) = HCF(12,8) = HCF(92,12) = HCF(104,92) = HCF(196,104) = HCF(496,196) = HCF(1188,496) = HCF(5248,1188) = HCF(6436,5248) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 73045 > 4, we apply the division lemma to 73045 and 4, to get
73045 = 4 x 18261 + 1
Step 2: Since the reminder 4 ≠ 0, we apply division lemma to 1 and 4, to get
4 = 1 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 4 and 73045 is 1
Notice that 1 = HCF(4,1) = HCF(73045,4) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 5248, 6436, 73045?
Answer: HCF of 5248, 6436, 73045 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5248, 6436, 73045 using Euclid's Algorithm?
Answer: For arbitrary numbers 5248, 6436, 73045 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.