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

HCF of 5735, 9804 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 5735, 9804 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 5735, 9804 is 1.

HCF(5735, 9804) = 1

HCF of 5735, 9804 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 5735, 9804 is 1.

Highest Common Factor of 5735,9804 using Euclid's algorithm

Highest Common Factor of 5735,9804 is 1

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

9804 = 5735 x 1 + 4069

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

5735 = 4069 x 1 + 1666

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

4069 = 1666 x 2 + 737

We consider the new divisor 1666 and the new remainder 737,and apply the division lemma to get

1666 = 737 x 2 + 192

We consider the new divisor 737 and the new remainder 192,and apply the division lemma to get

737 = 192 x 3 + 161

We consider the new divisor 192 and the new remainder 161,and apply the division lemma to get

192 = 161 x 1 + 31

We consider the new divisor 161 and the new remainder 31,and apply the division lemma to get

161 = 31 x 5 + 6

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

31 = 6 x 5 + 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 5735 and 9804 is 1

Notice that 1 = HCF(6,1) = HCF(31,6) = HCF(161,31) = HCF(192,161) = HCF(737,192) = HCF(1666,737) = HCF(4069,1666) = HCF(5735,4069) = HCF(9804,5735) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5735, 9804 using Euclid's Algorithm?

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