Question

Using Euclid's Division Algorithm, find the HCF of 6496 and 376?

Answer 1

Answer:

The HCF of 6796 and 376 is 8.

Step-by-step explanation:

Given: Nos. 6496 and 376

To find: HCF using Euclid's Division Algorithm

Step 1: Since, 6496 > 376, we apply the division lemma to 6496

            and 376, to get

                       ⇒   6496 = 376 × 17 + 104

Step 2: Since the remainder 104 ≠ 0, we apply the division lemma to

             376 and 104, to get

                      ⇒  376 = 104 × 3 + 64

Step 3: We consider the new divisor 104 and the new remainder 64,

            and apply the division lemma to get          

                      ⇒ 104 = 64 × 1 + 40

Step 4: We consider the new divisor 64 and the new remainder 40,

            and apply the division lemma to get          

                       ⇒ 64 = 40 × 1 + 24

Step 5: We consider the new divisor 40 and the new remainder 24,

            and apply the division lemma to get          

                      ⇒ 40 = 24 × 1 + 16

Step 6: We consider the new divisor 24 and the new remainder 16,

            and apply the division lemma to get          

                      ⇒ 24 = 16 × 1 + 8

Step 7: We consider the new divisor 16 and the new remainder 8,

            and apply the division lemma to get          

                       ⇒ 16  = 8 × 2 + 0

The remainder has now become zero, so our procedure stops. Since, the divisor at this stage is 8, the HCF of 6496 and 376 is 8.

Therefore, The HCF of 6796 and 376 is 8.

Answer 2

Hope this helps u........