ASSIGNMENT NO 2 (MTH 202)

ID:BC180400704

Question 1 Find the GCD of 255561, 25 using Division Algorithm.

Solution :1
255561, 25
:1.Divide 255561 by 25 :
This gives 255561  25.10222  11.
Divide 25 by 11:
This gives 25  11 · 2  3.
Divide 11 by 3 :
This gives 11  3 · 3  2.
Divide 3 by 2 :
This gives 3  2 · 1  1
Divide 2 by 1:
This gives 2  1 · 2  0
So, gcd  255561, 25   1

n2 (n  1)2
Question 2 Use mathematical induction to prove that 13  23  33  ...  n3  for all
4
positive integers.

Principal of Mathematic Induction:

Let P(n) be a propositional function defined for all positive integers n. P(n) is true for
every positive integer n if
1.Basis Step:
The proposition P(1) is true.
2. Inductive Step:
If P(k) is true then P(k + 1) is true for all integers k ≥ 1.
i.e. ∀ k p (k) → P (k + 1)
 n 2  n  1
2

Let p (n) :1  2  3  ...  n 

3 3 3 3

4
Basis:
P 1 is true .For n  1,
left hand side of P 1 is the sum of all the successive int eger ' s cube starting
at 13 and ending at 13 , so L HS  1 as follow
L.H.S of P (1)  13  1
12 (1  1) 2
R.H.S of P (1) 
4
2
1(2)
P (1) 
4
1(4)
P (1) 
4
4
P (1)   1
4
so the proposition is true for n  1.
Inductive:
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
2 2

13  23  33  ...  ( k  1)3 
4
k
 1  k  2 
2 2

1  2  3  ...  ( k  1)
3 3 3 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
4
2
2 k
  k  1 [  (k  1)]
4
 k 2
 4(k  1) 
  k  1 
2

 4 
2  k  4k  4 
2
  k  1  
 4 
2  k  2
 2

  k  1  
 4 
 
k  1  k  2 
2 2

  R .H .S
4

Hence P  k +1 is also true and so,

by Mathematical induction the given equation is true for all integers n  1.