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