Highest Common Factor of 456, 738, 258 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, 738, 258 i.e. 6 the largest integer that leaves a remainder zero for all numbers.
HCF of 456, 738, 258 is 6 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, 738, 258 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, 738, 258 is 6.
HCF(456, 738, 258) = 6
HCF of 456, 738, 258 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, 738, 258 is 6.
Highest Common Factor of 456,738,258 is 6
Step 1: Since 738 > 456, we apply the division lemma to 738 and 456, to get
738 = 456 x 1 + 282
Step 2: Since the reminder 456 ≠ 0, we apply division lemma to 282 and 456, to get
456 = 282 x 1 + 174
Step 3: We consider the new divisor 282 and the new remainder 174, and apply the division lemma to get
282 = 174 x 1 + 108
We consider the new divisor 174 and the new remainder 108,and apply the division lemma to get
174 = 108 x 1 + 66
We consider the new divisor 108 and the new remainder 66,and apply the division lemma to get
108 = 66 x 1 + 42
We consider the new divisor 66 and the new remainder 42,and apply the division lemma to get
66 = 42 x 1 + 24
We consider the new divisor 42 and the new remainder 24,and apply the division lemma to get
42 = 24 x 1 + 18
We consider the new divisor 24 and the new remainder 18,and apply the division lemma to get
24 = 18 x 1 + 6
We consider the new divisor 18 and the new remainder 6,and apply the division lemma to get
18 = 6 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 456 and 738 is 6
Notice that 6 = HCF(18,6) = HCF(24,18) = HCF(42,24) = HCF(66,42) = HCF(108,66) = HCF(174,108) = HCF(282,174) = HCF(456,282) = HCF(738,456) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 258 > 6, we apply the division lemma to 258 and 6, to get
258 = 6 x 43 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 6 and 258 is 6
Notice that 6 = HCF(258,6) .
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, 738, 258 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, 738, 258?
Answer: HCF of 456, 738, 258 is 6 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 456, 738, 258 using Euclid's Algorithm?
Answer: For arbitrary numbers 456, 738, 258 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.