Math, asked by thakuranuragsingh632, 9 months ago

use Euclid division algorithm to find hcf of 134791 , 6341 and 6339​

Answers

Answered by neelaaruna2020
3

Step-by-step explanation:

a = bq + r, where 0 ≤ r <b. According to the question apply the division lemma to 6339 & 6341. ➡ The remainder is zero. Now, we have to find the HCF of 1 & 134791

Similar questions