Find the hcf by euclids division algorithm of the number 1405,1465,and 1530
Answers
Answered by
0
find the solution by putting the formula of euclids division lemma I.e. a=bq+r
first find the 1st two no. then find the solution by putting the same formula in the result of 1st problem with the last no.
first find the 1st two no. then find the solution by putting the same formula in the result of 1st problem with the last no.
joashjohnsongodbless:
Do it
Answered by
2
I hope this will help you
Attachments:
Similar questions