Question

Find hcf of numbers 134791, 6341 and 6339 by euclid's division algorithm.

Answer 1

We know that,

a = bq + r, where 0 ≤ r <b.

According to the question apply the division lemma to 6339 & 6341.

➡ 6341 = 6339 * 1 + 2

➡6339 = 2 * 3169 + 1

➡ 2 = 2 * 1 + 0

➡ The remainder is zero.

➡ so HCF ( 6341, 6339 ) = 1

Now, we have to find the HCF of 1 & 134791.

➡ 134791 = 1 * 134791 + 0

➡ Now, HCF ( 1, 134791 ) = 1

Therefore HCF ( 6339, 6341, 134791 ) = 1

Hope it will help you !!!

Answer 2

hope it help!!

please mark as brainliest