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

HCF of 1851, 3649, 88845 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 1851, 3649, 88845 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 1851, 3649, 88845 is 1.

HCF(1851, 3649, 88845) = 1

HCF of 1851, 3649, 88845 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 1851, 3649, 88845 is 1.

Highest Common Factor of 1851,3649,88845 using Euclid's algorithm

Highest Common Factor of 1851,3649,88845 is 1

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

3649 = 1851 x 1 + 1798

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

1851 = 1798 x 1 + 53

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

1798 = 53 x 33 + 49

We consider the new divisor 53 and the new remainder 49,and apply the division lemma to get

53 = 49 x 1 + 4

We consider the new divisor 49 and the new remainder 4,and apply the division lemma to get

49 = 4 x 12 + 1

We consider the new divisor 4 and the new remainder 1,and apply the division lemma to get

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(49,4) = HCF(53,49) = HCF(1798,53) = HCF(1851,1798) = HCF(3649,1851) .

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

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

88845 = 1 x 88845 + 0

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

Notice that 1 = HCF(88845,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 1851, 3649, 88845 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 1851, 3649, 88845?

Answer: HCF of 1851, 3649, 88845 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 1851, 3649, 88845 using Euclid's Algorithm?

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