Discrete Mathematics Assignment-V Deadline: 30th April 2020

Assignment-V

Course : Discrete Mathematics

Instructor : Dr . Nasir Touheed

Deadline :
30 th April−2020 , 11 :55 pm

Note : Submit clear scanned PDF file of assignment usingthe link given below before
the deadline . Nolate submission will be accepted .∧kindly avoid copying , bothwill be
penalized if found pilagrised .

Submit your assignment using thelink givenbelow with file name as your name
¿ ERP (i. e . Name−1234. pdf ):

https://forms.gle/peHcEaAPdYtvz5R56

Question No .1

Proof the followings using 1 st principle .

I. Provethat for every positive integer n ,
1 1 1
1+ + + ·· ·+ >2( √ n+1−1)
√2 √3 √n
II. 2002n+ 2+2003 2n +1 is divisible by 4005.
III. 1.1 !+2.2 !+…+ n. n !=( n+1 ) !−1

1
Discrete Mathematics Assignment-V Deadline: 30th April 2020

Question No .2

I. Which amounts of money can be formed using just two dollar bills∧¿
five dollar bills? Prove your answer using strong induction .
II. Use strong induction ¿ prove that √ 2is irrational .
n
[Hint : Let P ( n ) be the statement that √ 2 ≠ for any positive integer b .
b ]

Question No .3

Consider the following variation of the game. The game begins with n matches .
Two players take turns removingmatches , one , two ,∨three at a time . The
player removing thelast match loses . Use strong induction ¿ show that if
each player plays thebest strategy possible , the first player wins if
n=4 j , 4 j+2 ,∨4 j+ 3 for some nonnegative integer j∧the second
player wins ∈theremaining case when n=4 j+ 1 for some
nonnegative integer j .

Question No .4

The fibonacci sequenceis defined as x 0=0 , x1 =1∧x n+2=x n + x n+1

for all nonnegative integers n . Prove that ,

I. x m=x r +1 x m−r + x r x m−r −1 for all integer m≥1∧0 ≤ r ≤ m−1
II. x d∣x kd for all integers k∧d

2
Discrete Mathematics Assignment-V Deadline: 30th April 2020

Question No .5

I. Verify that the program segment

x≔3
z≔ x+ y
if y >0 then
z ≔ z +1
else
z :=0
is correct with respect ¿ the initial assertion y=1∧the final assertion
z=5.

II. Use a loop invariant ¿ prove that the following program segment for computing
the nth power , where n is a positive integer , of a real number x iscorrect .

power ≔ 1
i≔ 1
while i≤ n
power ≔ power∗x
i:=i +1