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 9369, 8481, 13556 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9369, 8481, 13556 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 9369, 8481, 13556 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 9369, 8481, 13556 is 1.
HCF(9369, 8481, 13556) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9369, 8481, 13556 is 1.
Step 1: Since 9369 > 8481, we apply the division lemma to 9369 and 8481, to get
9369 = 8481 x 1 + 888
Step 2: Since the reminder 8481 ≠ 0, we apply division lemma to 888 and 8481, to get
8481 = 888 x 9 + 489
Step 3: We consider the new divisor 888 and the new remainder 489, and apply the division lemma to get
888 = 489 x 1 + 399
We consider the new divisor 489 and the new remainder 399,and apply the division lemma to get
489 = 399 x 1 + 90
We consider the new divisor 399 and the new remainder 90,and apply the division lemma to get
399 = 90 x 4 + 39
We consider the new divisor 90 and the new remainder 39,and apply the division lemma to get
90 = 39 x 2 + 12
We consider the new divisor 39 and the new remainder 12,and apply the division lemma to get
39 = 12 x 3 + 3
We consider the new divisor 12 and the new remainder 3,and apply the division lemma to get
12 = 3 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 9369 and 8481 is 3
Notice that 3 = HCF(12,3) = HCF(39,12) = HCF(90,39) = HCF(399,90) = HCF(489,399) = HCF(888,489) = HCF(8481,888) = HCF(9369,8481) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 13556 > 3, we apply the division lemma to 13556 and 3, to get
13556 = 3 x 4518 + 2
Step 2: Since the reminder 3 ≠ 0, we apply division lemma to 2 and 3, to get
3 = 2 x 1 + 1
Step 3: 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 3 and 13556 is 1
Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(13556,3) .
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 9369, 8481, 13556?
Answer: HCF of 9369, 8481, 13556 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9369, 8481, 13556 using Euclid's Algorithm?
Answer: For arbitrary numbers 9369, 8481, 13556 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.