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