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