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

HCF of 2445, 8785, 59951 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 2445, 8785, 59951 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 2445, 8785, 59951 is 1.

HCF(2445, 8785, 59951) = 1

HCF of 2445, 8785, 59951 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 2445, 8785, 59951 is 1.

Highest Common Factor of 2445,8785,59951 using Euclid's algorithm

Highest Common Factor of 2445,8785,59951 is 1

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

8785 = 2445 x 3 + 1450

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

2445 = 1450 x 1 + 995

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

1450 = 995 x 1 + 455

We consider the new divisor 995 and the new remainder 455,and apply the division lemma to get

995 = 455 x 2 + 85

We consider the new divisor 455 and the new remainder 85,and apply the division lemma to get

455 = 85 x 5 + 30

We consider the new divisor 85 and the new remainder 30,and apply the division lemma to get

85 = 30 x 2 + 25

We consider the new divisor 30 and the new remainder 25,and apply the division lemma to get

30 = 25 x 1 + 5

We consider the new divisor 25 and the new remainder 5,and apply the division lemma to get

25 = 5 x 5 + 0

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

Notice that 5 = HCF(25,5) = HCF(30,25) = HCF(85,30) = HCF(455,85) = HCF(995,455) = HCF(1450,995) = HCF(2445,1450) = HCF(8785,2445) .

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

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

59951 = 5 x 11990 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(59951,5) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 2445, 8785, 59951 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 2445, 8785, 59951?

Answer: HCF of 2445, 8785, 59951 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2445, 8785, 59951 using Euclid's Algorithm?

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