Find HCF of numbers 134791, 6341 and 6339 by Euclid’s division algorithm.
KOI ANSWER BATTA DO.....
Answers
Answered by
3
Answer:
refer to the attachment below!!
Step-by-step explanation:
already inboxed you dear!!
mark me as the brainliest please
Attachments:
Answered by
3
Answer:
HCF of 134791, 6341 and 6339 is 1.
Step-by-step explanation:
First, we take the biggest 2 numbers 134791 and 6341.
=> 134791 = 6341*21 + 1630
=> 6341 = 1630*3 + 1451
=> 1630 = 1451*1 + 179
=> 1451 = 179*8 + 19
=> 179 = 19*9 + 8
=> 19 = 8*2 + 3
=> 8 = 3*2 + 2
=> 3 = 2*1 + 1
=> 2 = 1*2 + 0
∴ HCF of 134791 and 6341 is 1.
Now, we have to find HCF of 1 and 6339.
=> 6339 = 1*6339 + 0
∴ HCF of 6339 and 1 is 1.
∴ HCF of 134791, 6341 and 6339 is 1.
Similar questions