use euclids division algorithms to find hcf of each of the following pairs of numbers (1) 18,32 (2) 70,30 (3) 714,924 (4) 100,190 (5) 105,120 (6) 155,1385 (7) 4641,4095 (8) 9367,3451 . with full prosses? whoever answers i will put you to brainlist
Answers
Answered by
1
Answer:
umm i also want pls answer
Answered by
4
We find hcf with help of euclid divison lemma and this process is called euclid divison algorithm . we till divide the no. that remainder become zero.
Hope you understand.
Attachments:
Similar questions
Math,
4 months ago
Math,
4 months ago
English,
10 months ago
Social Sciences,
1 year ago
History,
1 year ago