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