Math, asked by rahuldaroch39, 2 months ago

2775 and 295 find HCF with Euclid s division algorithm and one more 37728 and 12156 with same division and full lines​

Answers

Answered by nikitajain2259
0

Step-by-step explanation:

this basic division dividing remainder as divisor and dividend as previous divisor .. till you get remainder as 0

then final divisor is the answer

Similar questions