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