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