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