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