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