Highest Common Factor of 9837, 6936 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 9837, 6936 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 9837, 6936 is 3 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 9837, 6936 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 9837, 6936 is 3.
HCF(9837, 6936) = 3
HCF of 9837, 6936 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9837, 6936 is 3.
Highest Common Factor of 9837,6936 is 3
Step 1: Since 9837 > 6936, we apply the division lemma to 9837 and 6936, to get
9837 = 6936 x 1 + 2901
Step 2: Since the reminder 6936 ≠ 0, we apply division lemma to 2901 and 6936, to get
6936 = 2901 x 2 + 1134
Step 3: We consider the new divisor 2901 and the new remainder 1134, and apply the division lemma to get
2901 = 1134 x 2 + 633
We consider the new divisor 1134 and the new remainder 633,and apply the division lemma to get
1134 = 633 x 1 + 501
We consider the new divisor 633 and the new remainder 501,and apply the division lemma to get
633 = 501 x 1 + 132
We consider the new divisor 501 and the new remainder 132,and apply the division lemma to get
501 = 132 x 3 + 105
We consider the new divisor 132 and the new remainder 105,and apply the division lemma to get
132 = 105 x 1 + 27
We consider the new divisor 105 and the new remainder 27,and apply the division lemma to get
105 = 27 x 3 + 24
We consider the new divisor 27 and the new remainder 24,and apply the division lemma to get
27 = 24 x 1 + 3
We consider the new divisor 24 and the new remainder 3,and apply the division lemma to get
24 = 3 x 8 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 9837 and 6936 is 3
Notice that 3 = HCF(24,3) = HCF(27,24) = HCF(105,27) = HCF(132,105) = HCF(501,132) = HCF(633,501) = HCF(1134,633) = HCF(2901,1134) = HCF(6936,2901) = HCF(9837,6936) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 9837, 6936 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 9837, 6936?
Answer: HCF of 9837, 6936 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9837, 6936 using Euclid's Algorithm?
Answer: For arbitrary numbers 9837, 6936 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.