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