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