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

HCF of 8806, 3495 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 8806, 3495 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 8806, 3495 is 1.

HCF(8806, 3495) = 1

HCF of 8806, 3495 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 8806, 3495 is 1.

Highest Common Factor of 8806,3495 using Euclid's algorithm

Highest Common Factor of 8806,3495 is 1

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

8806 = 3495 x 2 + 1816

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

3495 = 1816 x 1 + 1679

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

1816 = 1679 x 1 + 137

We consider the new divisor 1679 and the new remainder 137,and apply the division lemma to get

1679 = 137 x 12 + 35

We consider the new divisor 137 and the new remainder 35,and apply the division lemma to get

137 = 35 x 3 + 32

We consider the new divisor 35 and the new remainder 32,and apply the division lemma to get

35 = 32 x 1 + 3

We consider the new divisor 32 and the new remainder 3,and apply the division lemma to get

32 = 3 x 10 + 2

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

3 = 2 x 1 + 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 8806 and 3495 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(32,3) = HCF(35,32) = HCF(137,35) = HCF(1679,137) = HCF(1816,1679) = HCF(3495,1816) = HCF(8806,3495) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 8806, 3495 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 8806, 3495?

Answer: HCF of 8806, 3495 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 8806, 3495 using Euclid's Algorithm?

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