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