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 .
Solution:
MTH202 Discrete Mathematics Assignment 3 solution Fall 2012
