Saved Bookmarks
| 1. |
Use euclid division algorithum to find the hcf of 405 and 2520 |
| Answer» Firstly find prime factorisation of 405 and 2550 and watch common in both with lowest power that\'s hcf | |