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