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