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 5700, 7224 i.e. 12 the largest integer that leaves a remainder zero for all numbers.
HCF of 5700, 7224 is 12 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 5700, 7224 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 5700, 7224 is 12.
HCF(5700, 7224) = 12
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5700, 7224 is 12.
Step 1: Since 7224 > 5700, we apply the division lemma to 7224 and 5700, to get
7224 = 5700 x 1 + 1524
Step 2: Since the reminder 5700 ≠ 0, we apply division lemma to 1524 and 5700, to get
5700 = 1524 x 3 + 1128
Step 3: We consider the new divisor 1524 and the new remainder 1128, and apply the division lemma to get
1524 = 1128 x 1 + 396
We consider the new divisor 1128 and the new remainder 396,and apply the division lemma to get
1128 = 396 x 2 + 336
We consider the new divisor 396 and the new remainder 336,and apply the division lemma to get
396 = 336 x 1 + 60
We consider the new divisor 336 and the new remainder 60,and apply the division lemma to get
336 = 60 x 5 + 36
We consider the new divisor 60 and the new remainder 36,and apply the division lemma to get
60 = 36 x 1 + 24
We consider the new divisor 36 and the new remainder 24,and apply the division lemma to get
36 = 24 x 1 + 12
We consider the new divisor 24 and the new remainder 12,and apply the division lemma to get
24 = 12 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 5700 and 7224 is 12
Notice that 12 = HCF(24,12) = HCF(36,24) = HCF(60,36) = HCF(336,60) = HCF(396,336) = HCF(1128,396) = HCF(1524,1128) = HCF(5700,1524) = HCF(7224,5700) .
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 5700, 7224?
Answer: HCF of 5700, 7224 is 12 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5700, 7224 using Euclid's Algorithm?
Answer: For arbitrary numbers 5700, 7224 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.