ID: BC180409108

Question No: 1
Solution: -

GCD(255561, 25)
Divide 255561 by 25
This gives us 255561  25 10222  11
Divide 25 by 11
This gives us 25  11  2  3
Divide 11 by 3
This gives us 11  3  3  2
Divide 3 by 2
This gives us 3  2 1  1
Divide 2 by 1
This gives us 2  1  2  0
Hence GCD  255561, 25   1 Answer
Question no: 2
Solution: -
n 2  n  1
2

1  2  3  ...  n 
3 3 3 3
for all positive integers
4
Let P(n) denotes the given equation
Basis Step:
P (1) is true for n  1
L.H.S of P (1)  13  1
12 (1  1) 2 4
R.H.S of P(1)   1
4 4
So L.H .S  R.H .S of P 1 .Hence P 1 is true
Inductive Step:
Suppose P (k ) is true for some integers k  1
k 2  k  1
2

13  23  33  ...  k 3  (i)
4
To prove P(k  1) is true
 k  1  k  1  1  k  1  k  2 
2 2 2 2

13  23  33  ...  (k  1)3   13  23  33  ...  (k  1)3 

4 4
Opening powers
k 4  6k 3  13k 2  12k  4
13  23  33  ...  (k  1)3  (ii)
4
Consider L.H.S of above equation  ii 
13  23  33  ...  (k  1)3  13  23  33  ...  k 3  ( k  1)3
k 2  k  1
2

  (k  1)3   a  b   a 2  2 ab  b 2  a  b   a 3  3a 2b  3ab 2  b3
2 3
and
4
k  2k 3  k 2
4
  k 3  3k 2  3k  1
4
k 4  2k 3  k 2  4k 3  12k 2  12k  4

4
k 4  6k 3  13k 2  12k  4

4
Hence P  k +1 is also true and so by Mathematical induction the given equation is true for all integers n  1.