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 790, 930, 856 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 790, 930, 856 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 790, 930, 856 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 790, 930, 856 is 2.
HCF(790, 930, 856) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 790, 930, 856 is 2.
Step 1: Since 930 > 790, we apply the division lemma to 930 and 790, to get
930 = 790 x 1 + 140
Step 2: Since the reminder 790 ≠ 0, we apply division lemma to 140 and 790, to get
790 = 140 x 5 + 90
Step 3: We consider the new divisor 140 and the new remainder 90, and apply the division lemma to get
140 = 90 x 1 + 50
We consider the new divisor 90 and the new remainder 50,and apply the division lemma to get
90 = 50 x 1 + 40
We consider the new divisor 50 and the new remainder 40,and apply the division lemma to get
50 = 40 x 1 + 10
We consider the new divisor 40 and the new remainder 10,and apply the division lemma to get
40 = 10 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 10, the HCF of 790 and 930 is 10
Notice that 10 = HCF(40,10) = HCF(50,40) = HCF(90,50) = HCF(140,90) = HCF(790,140) = HCF(930,790) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 856 > 10, we apply the division lemma to 856 and 10, to get
856 = 10 x 85 + 6
Step 2: Since the reminder 10 ≠ 0, we apply division lemma to 6 and 10, to get
10 = 6 x 1 + 4
Step 3: 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 10 and 856 is 2
Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(10,6) = HCF(856,10) .
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 790, 930, 856?
Answer: HCF of 790, 930, 856 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 790, 930, 856 using Euclid's Algorithm?
Answer: For arbitrary numbers 790, 930, 856 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.