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