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

HCF of 2451, 1567, 51490 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 2451, 1567, 51490 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 2451, 1567, 51490 is 1.

HCF(2451, 1567, 51490) = 1

HCF of 2451, 1567, 51490 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 2451, 1567, 51490 is 1.

Highest Common Factor of 2451,1567,51490 using Euclid's algorithm

Highest Common Factor of 2451,1567,51490 is 1

Step 1: Since 2451 > 1567, we apply the division lemma to 2451 and 1567, to get

2451 = 1567 x 1 + 884

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

1567 = 884 x 1 + 683

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

884 = 683 x 1 + 201

We consider the new divisor 683 and the new remainder 201,and apply the division lemma to get

683 = 201 x 3 + 80

We consider the new divisor 201 and the new remainder 80,and apply the division lemma to get

201 = 80 x 2 + 41

We consider the new divisor 80 and the new remainder 41,and apply the division lemma to get

80 = 41 x 1 + 39

We consider the new divisor 41 and the new remainder 39,and apply the division lemma to get

41 = 39 x 1 + 2

We consider the new divisor 39 and the new remainder 2,and apply the division lemma to get

39 = 2 x 19 + 1

We consider the new divisor 2 and the new remainder 1,and apply the division lemma 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 2451 and 1567 is 1

Notice that 1 = HCF(2,1) = HCF(39,2) = HCF(41,39) = HCF(80,41) = HCF(201,80) = HCF(683,201) = HCF(884,683) = HCF(1567,884) = HCF(2451,1567) .

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

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

51490 = 1 x 51490 + 0

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

Notice that 1 = HCF(51490,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 2451, 1567, 51490 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 2451, 1567, 51490?

Answer: HCF of 2451, 1567, 51490 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2451, 1567, 51490 using Euclid's Algorithm?

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