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