Class 10 Maths || Ch 1 Real Numbers || Exercise 1.1 || HCF By Euclid's Algorithm

1. Use Euclid’s division algorithm to find the HCF of :
(i) 135 and 225
(ii) 196 and 38220
(iii) 867 and 255
2. Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is
some integer.
3. An army contingent of 616 members is to march behind an army band of 32 members in
a parade. The two groups are to march in the same number of columns. What is the
maximum number of columns in which they can march?
4. Use Euclid’s division lemma to show that the square of any positive integer is either of
the form 3m or 3m + 1 for some integer m.
[Hint : Let x be any positive integer then it is of the form 3q, 3q + 1 or 3q + 2. Now square
each of these and show that they can be rewritten in the form 3m or 3m + 1.]
5. Use Euclid’s division lemma to show that the cube of any positive integer is of the form
9m, 9m + 1 or 9m + 8.

New Course English Medium
Class 6 Maths :    • Class 6 Maths | All Exercise of All C...  
Class 7 Maths :    • Class 7 Maths | All Exercise of All C...  
Class 8 Maths :    • Class 8 Maths | New Syllabus 2024-25 ...  
Class 9 Maths :    • Class 9 Maths NCERT | New Syllabus 20...  
Class 10 Math :    • Class 10 Maths | New Syllabus 2024-25...  

Half Yearly Exam Paper Solution ::    • New Half Yearly Exam Paper Solution 2024  
Class 9 Maths RD Sharma :::    • RD Sharma Class 9 Math English Medium  
Class 9 Maths Dr Manohar Ray ::    • Dr. Manohar re ||Class 9th Maths  

New Course In Hindi Medium
Class 8 Maths :    • In Hindi | Class 8 Maths | All Exerci...  
Class 9 Maths :    • In Hindi | Class 9 Maths | New Syllab...  
Class 10 Math :    • In Hindi | Class 10 Maths | All Exerc...