Math, asked by rekhajainrj42, 9 months ago

135 and 225 by euclid division algorithm​

Answers

Answered by bk4129050
1

Answer:

what we have to find l.c.m or h.c.f?

Answered by bbb86
3

Step-by-step explanation:

If you want to find HCF , here is the solution

225=135*1+90

135=90*1+45

90=45*2+0

Hence , the reminder become zero and divisor at last stage is 45.

So,HCF is 45

Hope this will help you !

Similar questions