Question

M
EXERCISE 8.1
1. Use Euclid's division algorithm to find the HCF of:
6) 135 and 225
00) 196 and 38220
(iii) 867 and 255
2. Show that any positive odd integer is of the form 6q+1, or 6q+3, or 695, where
some integer
3. An army contingent of 616 members is to march behind an army band of 32 membe
* parade. The two groups are to march in the same number of columns. What i
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 eit
the form 3m or 3ml for some integer m.
tint
integer th
the forma​

Answer 1

Answer:

10 class maths

Step-by-step explanation:

225=135×1+90

135=90×1+45

90=45×2+0

HCF is 45