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