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

HCF of 9786, 2785 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 9786, 2785 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 9786, 2785 is 1.

HCF(9786, 2785) = 1

HCF of 9786, 2785 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 9786, 2785 is 1.

Highest Common Factor of 9786,2785 using Euclid's algorithm

Highest Common Factor of 9786,2785 is 1

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

9786 = 2785 x 3 + 1431

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

2785 = 1431 x 1 + 1354

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

1431 = 1354 x 1 + 77

We consider the new divisor 1354 and the new remainder 77,and apply the division lemma to get

1354 = 77 x 17 + 45

We consider the new divisor 77 and the new remainder 45,and apply the division lemma to get

77 = 45 x 1 + 32

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

45 = 32 x 1 + 13

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

32 = 13 x 2 + 6

We consider the new divisor 13 and the new remainder 6,and apply the division lemma to get

13 = 6 x 2 + 1

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

6 = 1 x 6 + 0

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

Notice that 1 = HCF(6,1) = HCF(13,6) = HCF(32,13) = HCF(45,32) = HCF(77,45) = HCF(1354,77) = HCF(1431,1354) = HCF(2785,1431) = HCF(9786,2785) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9786, 2785 using Euclid's Algorithm?

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