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