S No. Topic Video
1 Ex: 1.1 Question # 1 Use Euclid’s division algorithm to find out the HCF of: 1) 135 and 225 2) 196 and 38220 3) 867 and 255
2 1.1 Q2 Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer.
3 1.1 Q3 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 1.1 Q4 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.
5 1.1 Q5 Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.
6 1.2 Q1 Express each number as a product of its prime factors. 1) 140 2) 156 3) 3825 4) 7429
7 1.2 Q2 Find the LCM and HCF of the following pairs of integers and verify that LCM x HCF = product of the two numbers.
8 1.2 Q3 Find the LCM and HCF of the following integers by prime factorization method.
9 1.2 Q4 Given that HCF (306, 657) = 9, find LCM (306, 657)
10 1.2 Q5 Check whether 6 raised to n can end with the digit 0 for any natural number n.
Topic/Video

1 Ex: 1.1 Question # 1 Use Euclid’s division algorithm to find out the HCF of: 1) 135 and 225 2) 196 and 38220 3) 867 and 255

2 1.1 Q2 Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer.

3 1.1 Q3 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 1.1 Q4 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.

5 1.1 Q5 Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.

6 1.2 Q1 Express each number as a product of its prime factors. 1) 140 2) 156 3) 3825 4) 7429

7 1.2 Q2 Find the LCM and HCF of the following pairs of integers and verify that LCM x HCF = product of the two numbers.

8 1.2 Q3 Find the LCM and HCF of the following integers by prime factorization method.

9 1.2 Q4 Given that HCF (306, 657) = 9, find LCM (306, 657)

10 1.2 Q5 Check whether 6 raised to n can end with the digit 0 for any natural number n.

© 2017 Mathsphy. All Rights Reserved.Designed with by Sam Web Studio

SAM WEB STUDIO
Website Designing Company Web Development Company India