This blog makes available plenty of questions for practice, for the Mathematics competitive exams. We also try to bring to students interesting ways of approaching the questions.
If you need any assistance in questions from IPM, MTSE, SCHOLARSHIP, OLYMPIAD, CBSE , ICSE or Board test papers, you may write to us.
Friday, August 9, 2013
Division , HCF and LCM
Use Euclid’s division algorithm to
find the HCF. Also find which of the following pairs of numbers are co-prime:
No comments:
Post a Comment