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 948, 786, 52, 755 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 948, 786, 52, 755 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 948, 786, 52, 755 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 948, 786, 52, 755 is 1.
HCF(948, 786, 52, 755) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 948, 786, 52, 755 is 1.
Step 1: Since 948 > 786, we apply the division lemma to 948 and 786, to get
948 = 786 x 1 + 162
Step 2: Since the reminder 786 ≠ 0, we apply division lemma to 162 and 786, to get
786 = 162 x 4 + 138
Step 3: We consider the new divisor 162 and the new remainder 138, and apply the division lemma to get
162 = 138 x 1 + 24
We consider the new divisor 138 and the new remainder 24,and apply the division lemma to get
138 = 24 x 5 + 18
We consider the new divisor 24 and the new remainder 18,and apply the division lemma to get
24 = 18 x 1 + 6
We consider the new divisor 18 and the new remainder 6,and apply the division lemma to get
18 = 6 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 948 and 786 is 6
Notice that 6 = HCF(18,6) = HCF(24,18) = HCF(138,24) = HCF(162,138) = HCF(786,162) = HCF(948,786) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 52 > 6, we apply the division lemma to 52 and 6, to get
52 = 6 x 8 + 4
Step 2: Since the reminder 6 ≠ 0, we apply division lemma to 4 and 6, to get
6 = 4 x 1 + 2
Step 3: We consider the new divisor 4 and the new remainder 2, and apply the division lemma to get
4 = 2 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 6 and 52 is 2
Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(52,6) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 755 > 2, we apply the division lemma to 755 and 2, to get
755 = 2 x 377 + 1
Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 755 is 1
Notice that 1 = HCF(2,1) = HCF(755,2) .
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 948, 786, 52, 755?
Answer: HCF of 948, 786, 52, 755 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 948, 786, 52, 755 using Euclid's Algorithm?
Answer: For arbitrary numbers 948, 786, 52, 755 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.