Find the hcf. Using euclids division algorithum of 495 and 475
Answers
Answered by
4
Answer:
refer the above attachment provided
hope it is helpful
Attachments:
Answered by
3
495 = 475 x 1 + 20.
Since remainder ≠ 0, apply division lemma on 475 and remainder 20
475 = 20 x 23 + 15.
Since remainder ≠ 0, apply division lemma on 20 and remainder 15
20 = 15 x 1 + 5.
Since remainder ≠ 0, apply division lemma on 15 and remainder 5
15 = 5 x 3+ 0.
Similar questions