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