How to find HCF of 21, 66, 33 using Euclid's Algorithm?

For arbitrary numbers 21, 66, 33 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.

How to find HCF of 21, 66, 33 using Euclid's Algorithm?

For arbitrary numbers 21, 66, 33 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.

HCF of 21, 66, 33 using Euclid's algorithm

Q: What is the Euclid division algorithm?

Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

Q: what is the HCF of 21, 66, 33?

HCF of 21, 66, 33 is 3 the largest number that divides all the numbers leaving a remainder zero.

Created By : Jatin Gogia
Reviewed By : Rajashekhar Valipishetty
Last Updated at : Mar 29,2023

Want to know how to use Euclid’s algorithm to find the HCF of 21, 66, 33 ? Well, you have come to the right place. In this article, you will be learning about Euclid’s algorithm and how to use it to calculate the HCF with ease.
Take the help of the HCF Calculator using the Euclid Division Algorithm which finds HCF of 21, 66, 33 using Euclid's algorithm i.e 3 quickly.

Detailed Method to Find the HCF of 21,66,33 using Euclid's algorithm

Euclid’s algorithm is written as a = bq + r. This is known as the division lemma. The variable r varies according to 0 ≤ r ≤ b. We can use this to figure out the HCF of 21,66,33. This is how to do it.

Step 1: The first step is to use the division lemma with 66 and 21 because 66 is greater than 21

66 = 21 x 3 + 3

Step 2: Here, the reminder 21 is not 0, we must use division lemma to 3 and 21, to get

21 = 3 x 7 + 0

As you can see, the remainder is zero, so you may end the process at this point. From the last equation, we can determine that the divisor is 3.Therefore, the HCF of 21 and 66 is equal to 3

Notice that 3 = HCF(21,3) = HCF(66,21) .

Now, we must treat the HCF of the first two numbers as the next number in our calculation, and next

Step 1: The first step is to use the division lemma with 33 and 3 because 33 is greater than 3

33 = 3 x 11 + 0

As you can see, the remainder is zero, so you may end the process at this point. From the last equation, we can determine that the divisor is 3.Therefore, the HCF of 3 and 33 is equal to 3

Notice that 3 = HCF(33,3) .

Result

Hence, the HCF of 21, 66, 33 is equal to 3.

FAQ on HCF of 21, 66, 33 using Euclid's Algorithm

1. What is the Euclid division algorithm?

Answer: Euclid’s algorithm is represented as a = bq + r, and 0 ≤ r ≤ b..

2. How do you find HCF using Euclid's algorithm ?

Answer: Apply the division lemma to the numbers, and keep going until the remainder is zero. Once it becomes zero, the divisor will be your HCF.

3. What is the HCF of 21, 66, 33?

Answer: The HCF of 21, 66, 33 is 3.