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

HCF of 7085, 3869, 36343 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 7085, 3869, 36343 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 7085, 3869, 36343 is 1.

HCF(7085, 3869, 36343) = 1

HCF of 7085, 3869, 36343 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 7085, 3869, 36343 is 1.

Highest Common Factor of 7085,3869,36343 using Euclid's algorithm

Highest Common Factor of 7085,3869,36343 is 1

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

7085 = 3869 x 1 + 3216

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

3869 = 3216 x 1 + 653

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

3216 = 653 x 4 + 604

We consider the new divisor 653 and the new remainder 604,and apply the division lemma to get

653 = 604 x 1 + 49

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

604 = 49 x 12 + 16

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

49 = 16 x 3 + 1

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

16 = 1 x 16 + 0

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

Notice that 1 = HCF(16,1) = HCF(49,16) = HCF(604,49) = HCF(653,604) = HCF(3216,653) = HCF(3869,3216) = HCF(7085,3869) .

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

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

36343 = 1 x 36343 + 0

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

Notice that 1 = HCF(36343,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 7085, 3869, 36343 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 7085, 3869, 36343?

Answer: HCF of 7085, 3869, 36343 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 7085, 3869, 36343 using Euclid's Algorithm?

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