Highest Common Factor of 5865, 4167, 51781 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 5865, 4167, 51781 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 5865, 4167, 51781 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 5865, 4167, 51781 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 5865, 4167, 51781 is 1.

HCF(5865, 4167, 51781) = 1

HCF of 5865, 4167, 51781 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 5865, 4167, 51781 is 1.

Highest Common Factor of 5865,4167,51781 using Euclid's algorithm

Highest Common Factor of 5865,4167,51781 is 1

Step 1: Since 5865 > 4167, we apply the division lemma to 5865 and 4167, to get

5865 = 4167 x 1 + 1698

Step 2: Since the reminder 4167 ≠ 0, we apply division lemma to 1698 and 4167, to get

4167 = 1698 x 2 + 771

Step 3: We consider the new divisor 1698 and the new remainder 771, and apply the division lemma to get

1698 = 771 x 2 + 156

We consider the new divisor 771 and the new remainder 156,and apply the division lemma to get

771 = 156 x 4 + 147

We consider the new divisor 156 and the new remainder 147,and apply the division lemma to get

156 = 147 x 1 + 9

We consider the new divisor 147 and the new remainder 9,and apply the division lemma to get

147 = 9 x 16 + 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 5865 and 4167 is 3

Notice that 3 = HCF(9,3) = HCF(147,9) = HCF(156,147) = HCF(771,156) = HCF(1698,771) = HCF(4167,1698) = HCF(5865,4167) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 51781 > 3, we apply the division lemma to 51781 and 3, to get

51781 = 3 x 17260 + 1

Step 2: Since the reminder 3 ≠ 0, we apply division lemma to 1 and 3, to get

3 = 1 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 3 and 51781 is 1

Notice that 1 = HCF(3,1) = HCF(51781,3) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 5865, 4167, 51781 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 5865, 4167, 51781?

Answer: HCF of 5865, 4167, 51781 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5865, 4167, 51781 using Euclid's Algorithm?

Answer: For arbitrary numbers 5865, 4167, 51781 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.