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