Question

BERS
EXERCISE 1.1
135 and 225
Euclid's division algorithm to find the HCF of:
(ii) 196 and 38220
(iii) 867 and 255
that any positive odd integer is of the form 6q+1, or 6q+3, or 6q + 5, where a
integer
my contingent of 616 members is to march behind an army band of 32 members
de. The two groups are to march in the same number of columns. What is t
num number of columns in which they can march?
clid's division lemma to show that the square of any positive integer is either
m 3m or 3m + 1 for some integer m.​

Answer 1

Answer:

division lemma I don't understand please mark me as brainlist