MTH202 Discrete Mathematics Assignment No.3 solution Fall 2013

Sponsored Links



Assignment 3 Of MTH202 (Fall 2012)

Maximum Marks:15

Due Date: 15-01-2013


DONíT MISS THESE: Important instructions before attempting the solution of this assignment:

ē To solve this assignment, you should have good command over 20 - 30 lectures.

Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in the 20 to 30 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.
Use Math Type or Equation Editor etc for mathematical 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.
Try to make solution by yourself and protect your work from other students, otherwise you and the student who send same solution file as you will be given zero marks.
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.

Q#01: Use mathematical induction to prove that for every integer with . (Note that this inequality is false for and .) Marks = 6


Q#02: Find the GCD of and using Division Algorithm. Marks = 4


Q#03: Define a sequence by the formula , for all integers . Show that this sequence satisfies the recurrence relation , with and for all integers . Marks = 5