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