Method and examples
HCF_LCM
Problem 6 of 11

6. Greatest no which can divide , and leaving the same remainder in each case.
 
 
SolutionExample

Share with your friends
 
Copyright © 2018. All rights reserved. Terms, Privacy