www.mathsmagic.

in
Exercise 1.1
1. Answer
i.
Divide the greater number (225) with the smaller one (135). The divisor of
the first division is further divided by the remainder in that division. The
division is continued as shown below, till we get 0 as the remainder.

135

225

135

90

135
90
45

225 = 135 1 + 90

90
90
0

135 = 90 1 + 45

90 = 2 45 + 0
(225,135) = 45

The last divisor where we get 0 as remainder is our HCF. Or the remainder just
before 0 is our HCF
ii.

Divide the greater number (38220) with the smaller one (196). The divisor
of the first division has to be further divided by the remainder in that
division. The division has to be continued, till we get 0 as the remainder.

196

38220

38220
0

195

38220 = 196 195 + 0

(38220,196) = 196

Since we got 0 as the remainder in the first division, the divisor itself is the HCF.

www.mathsmagic.in
iii.

Divide the greater number (867) with the smaller one (255). The divisor of
the first division is further divided by the remainder in that division. The
division is continued as shown below, till we get 0 as the remainder.

255

867

765

102

3
255
204
51

867 = 255 3 + 102

102
102
0

255 = 102 2 + 51

102 = 51 2 + 0
(867,255) = 51

The last divisor where we get 0 as remainder is our HCF. Or the remainder just
before 0 is our HCF
2. Answer
Let take as any positive integer and = 6.
According to Euclids algorithm
= 6 + , here is remainder such that 0 < and the value
of 6
So total possible forms will = 6 + 0 , = 6 + 1
= 6 + 2, = 6 + 3, = 6 + 4, 6 + 5
6 is divisible by 2 , 6 is an even number
6 + 0, 6 + 2, 6 + 4

2 4 is divisible by 2 , 6 + 0, 6 + 2, 6 + 4 are even numbers

6 + 1, 6 + 3, 6 + 5

1,3 5 are not divisible by 2 , 6 + 1, 6 + 3, 6 + 5 are odd numbers

www.mathsmagic.in
3. Answer
HCF (616, 32) will give the maximum number of columns in which they can
march.
Using Euclid's algorithm

32

616

608
8

19
32
32
0

616 = 32 19 + 8

Therefore, they can march in 8 columns each.

32 = 8 4 + 0
(616, 32) = 8.

Since the question doesnt specify any method, you can find HCF by prime
factorization or other methods.
4. Answer
Let be any positive integer and = 3.
Then = 3 + such that 0 < 3
Therefore,
= 3 ,
= 3 + 1 ,
Squaring both sides we get;
2 = (3 )2 ,
2 = (3 + 1)2 ,
2 = 9 2 ,
2 = 9 2 + 6 + 1,
2 = 3 (3 2 ), 2 = 3(3 2 + 2 ) + 1,

= 3 + 2

2 = (3 + 2)2
2 = 9 2 + 12 + 4
2 = 3(3 2 + 4 + 1) + 1

Hence, it can be said that the square of any positive integer is either of the form
3m or 3m + 1. Where is (3 2 ), 3 2 + 2 or (3 2 + 4 + 1)

www.mathsmagic.in
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.
Answer
Let be any positive integer and = 3.
Then = 3 + such that 0 < 3
Therefore,
= 3 ,
= 3 + 1 ,
= 3 + 2
Taking cube on both sides we get;
3 = (3 )3 , 3 = (3 + 1)3 ,
3 = (3 + 2)3
3 = 27 3 ,
3 = 27 3 + 27 2 + 9 + 1,
3 = 273 + 54 2 + 36 + 8
3 = 9 (3 3 ), 3 = 3(3 3 + 3 2 + ) + 1, 3 = 3(3 3 + 6 2 + 4 ) + 8
Hence, it can be said that the square of any positive integer is either of the form
9m or 9m + 1 or 9m + 1 .
Where is (3 3 ), 33 3 + 3 2 + + 1 33 3 + 6 2 + 4 + 8