Using Euclid's Division Algorithm, Find
1. HCF(2002,2618)
Answers
Answered by
5
Answer:
Firstly we have to find HCF of 2002 and 2618 by using Euclid's division algorithm to find the greatest number of cartons each stack would have. Here, remainder = 0 & the divisor is 154. HCF of 2002 and 2618 is 154. Hence, 154 is the greatest number of cartons each stack would have .
plz make me the brainliest
Step-by-step explanation:
Answered by
5
Answer:
I think u
got help......thanks...........pls like it
sorry 154 is answer my friend not 616....sorry
Attachments:
Similar questions