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