ASSIGNMENT NO 2(MTH 202)

Maximum Marks: 10
Due Date: 23rd January, 2019.

BC180205023 USAMA AHMED

DON’T MISS THESE: Important instructions before attempting the solution of this
assignment:
 To solve this assignment, you should have good command over 23 - 28 lectures.
 Upload assignments properly through LMS, No Assignment will be accepted
through email.
 Write your ID on the top of your solution file.
 Don’t use colorful back grounds in your solution files.
 Always send your solution in dox or docx file with proper accessible math type
symbols.
 You should remember that if we found the solution files of some students are
same then we will reward zero marks to all those students.
 Also remember that you are supposed to submit your assignment in Word format
any other like scan images etc will not be accepted and we will give zero marks
correspond to these assignments.

Question No. 1:

Prove the following by using the principle of Mathematical induction

1 1 1 1 n
   ......................  ,  integers n  1
1 3 3  5 5  7 (2n  1)(2n  1) 2n  1

SOLUTION:
Basis Step :
For n  1
L.H .S
1

(2n  1)(2n  1)
1
 n  1
(2(1)  1)(2(1)  1)
1

(2  1)(2  1)
1

(1)(3)
1

3
R.H .S
n

2n  1
(1)
 n  1
2(1)  1
1

2 1
1

3
As L.H.S  R.H.S, Hence the given formula is true for n  1.

INDUCTIVE STEP
Suppose for some values of k  1
1 1 1 1 k
   ......................  .................(1)
1 3 3  5 5  7 (2k  1)(2k  1) 2k  1
We must showthat
1 1 1 1 (k  1)
   ...................... 
1 3 3  5 5  7 (2( k  1)  1)(2( k  1)  1) 2( k  1)  1
1 1 1 1 k 1
   ...................... 
1 3 3  5 5  7 (2k  2  1)(2k  2  1) 2k  2  1
1 1 1 1 k 1
   ......................  ..................(2)
1 3 3  5 5  7 (2k  1)(2k  3) 2k  3

Now we will consider L.H.S of the equation  2  and will try to get the R.H.S by equation by using equation 1 and some other computation

Consider L.H.S of  2 
1 1 1 1
    ......................
1 3 3  5 5  7 (2k  1)(2k  3)
rewrites as
1 1 1 1 1
    ......................  
1 3 3  5 5  7 (2k  1)(2k  1) (2k  1)(2k  3)
As we know from equation (1)
1 1 1 1 k
   ......................  
1 3 3  5 5  7 (2k  1)(2k  1) 2k  1
1 1 1 1 k
So, replacing    ......................  by in equation (2)
1 3 3  5 5  7 (2k  1)(2k  1) 2k  1
The equation (2) became,
k 1
 
2k  1 (2k  1)(2k  3)
1
taking , we get.
2k  1
1 k 1 
 
2k  1  1 2k  3 
1  k (2k  3)  1 

2k  1  2k  3 
1  2k 2  3k  1 

2k  1  2k  3 
1  2k 2  2k  1k  1 

2k  1  2k  3 

1  2k (k  1)  1(k  1) 

2k  1  2k  3 
1  (k  1)(2k  1) 

2k  1  2k  3 
2k  1  k  1 

2k  1  2k  3 
k 1

2k  3
Question No 2:
Use the Euclidean algorithm to find GCD (1701, 3768)

Solution:

1. Divides 3768 by 1701 gives

3768 1701  2  366
2. Divides 1701 by 366 gives
1701  366  4  237
3. Divides 366 by 237 gives
366  237 1  129
4. Divides 237 by 129 gives
237 129 1  108
5. Divides 129 by 108 gives
129  108 1  21
6. Divides 108 by 21 gives
108  21 5  3
7. Divides 21 by 3 gives
21=3.7+0

Hence GCD (1701, 3768) is 3