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