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