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