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