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