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