Highest Common Factor of 360, 795, 836 using Euclid's algorithm
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 360, 795, 836 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 360, 795, 836 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 360, 795, 836 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 360, 795, 836 is 1.
HCF(360, 795, 836) = 1
HCF of 360, 795, 836 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 360, 795, 836 is 1.
Highest Common Factor of 360,795,836 is 1
Step 1: Since 795 > 360, we apply the division lemma to 795 and 360, to get
795 = 360 x 2 + 75
Step 2: Since the reminder 360 ≠ 0, we apply division lemma to 75 and 360, to get
360 = 75 x 4 + 60
Step 3: We consider the new divisor 75 and the new remainder 60, and apply the division lemma to get
75 = 60 x 1 + 15
We consider the new divisor 60 and the new remainder 15, and apply the division lemma to get
60 = 15 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 15, the HCF of 360 and 795 is 15
Notice that 15 = HCF(60,15) = HCF(75,60) = HCF(360,75) = HCF(795,360) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 836 > 15, we apply the division lemma to 836 and 15, to get
836 = 15 x 55 + 11
Step 2: Since the reminder 15 ≠ 0, we apply division lemma to 11 and 15, to get
15 = 11 x 1 + 4
Step 3: We consider the new divisor 11 and the new remainder 4, and apply the division lemma to get
11 = 4 x 2 + 3
We consider the new divisor 4 and the new remainder 3,and apply the division lemma to get
4 = 3 x 1 + 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 15 and 836 is 1
Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(11,4) = HCF(15,11) = HCF(836,15) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 360, 795, 836 using Euclid's Algorithm
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 360, 795, 836?
Answer: HCF of 360, 795, 836 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 360, 795, 836 using Euclid's Algorithm?
Answer: For arbitrary numbers 360, 795, 836 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.