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 6396, 7395 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 6396, 7395 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 6396, 7395 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 6396, 7395 is 3.
HCF(6396, 7395) = 3
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6396, 7395 is 3.
Step 1: Since 7395 > 6396, we apply the division lemma to 7395 and 6396, to get
7395 = 6396 x 1 + 999
Step 2: Since the reminder 6396 ≠ 0, we apply division lemma to 999 and 6396, to get
6396 = 999 x 6 + 402
Step 3: We consider the new divisor 999 and the new remainder 402, and apply the division lemma to get
999 = 402 x 2 + 195
We consider the new divisor 402 and the new remainder 195,and apply the division lemma to get
402 = 195 x 2 + 12
We consider the new divisor 195 and the new remainder 12,and apply the division lemma to get
195 = 12 x 16 + 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 6396 and 7395 is 3
Notice that 3 = HCF(12,3) = HCF(195,12) = HCF(402,195) = HCF(999,402) = HCF(6396,999) = HCF(7395,6396) .
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 6396, 7395?
Answer: HCF of 6396, 7395 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6396, 7395 using Euclid's Algorithm?
Answer: For arbitrary numbers 6396, 7395 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.