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