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