ICT 215 SEM 1 2015/2016 1

Mzumbe University
Faculty of Science and Technology
Ict215:Discrete Mathematics
Tutorial sheet 6:

Enumerative Analysis
1. By stating clearly the Boolean law(s) applied, prove that Boolean multiplication is distributive over Boolean
addition.
2. Obtain the canonical sum of products(Disjunctive Normal form) of the function G = AB + AC D.

3. Obtain the canonical product of sums(Conjunctive Normal form) of the function H = (A + B )(B + C )(A + C ).

4. Realize the logic expression F (A; B; C ) = B C + AC + AB using basic gates and hence implement it using NAND
gates only.

5. What is Recursion ?
6. Write down the Recursive(Inductive) denition of the function whose domain is the set of positive integers.

7. Consider the rst order homogeneous recurrence relation xn = rxn 1 (n > 0); and x0 = A. By Iteration
method show that the general solution of this recurrence relation is a geometric sequence with ratio r, that is
n
xn = Ar

8. Give a non-homogeneous recurrence relation xn = rxn 1 + cn ; (n > 0) and x0 = A. With the technique of
iteration show that the general solution of this recurrence relation is

x
n
n = Ar +
X n
k
c r
n k
k=1

Hence examine two cases for this solution

i) when cn is a constant c and r 6= 1 and r = 1.

ii) when cn = c + dn, where c and d are constant and r = 1

9. Assume that a country with currently 100 million people has a population growth rate(birth rate minus death
rate) of 1% per year, and it also receives 100 thousand immigrants per year (which are quickly assimilated and
reproduce at the same rate as the native population). Find its population in ten (10) years from now. (Assume
that all the immigrants arrive in a single batch at the end of the year).

10. Solve the following recurrence relations

a) an = 5an 1 + 6 an 2; (n  2) with initial conditions a0 = 1 and a1 =4

b) xn+2 = 5xn+1 + 6xn ; (n  0) with initial conditions x0 = 4 and x1 =6
c) bn = 2bn 1 2bn 2; (n  2) with initial conditions b0 = 1 and b1 =3
ICT 215 SEM 1 2015/2016 2

11. Find the general solution for each of the following recurrence relations

a) an+2 + 4an+1 + 3an = 0; (n  0).

b) sn+2 + 4sn+1 = 0; (n  0)
c) bn+2 + 4bn+1 + 16bn = 0; (n  0)

12. By the method of undeterminate coecients , solve the following recurrence relations:
a) an+2 + 4an+1 + 3an = 5( 2)n ; (n  0).
b) sn+2 + 4sn+1 = 6 cos( n
2
) + 3 sin( n
2
); (n  0)
c) bn+2 + 4bn+1 + 16bn = 4n+2 cos( n
2
) + 4n+3 sin( n
2
); (n  0)
d) an+2 + 4an = 2n cos( n
2
)

13. Use undeterminate coecients method to nd the solution of the recurrence relation
n
a +3 + 5an+2 + 8an+1 + 4an = 2( 1)n + ( 2)n+3 ; with initial conditions a0 = 4; a1 = 11 and a2 = 41

14. Find the generating function for the sequence 0; 2; 6; 12; 20; 30; 42; : : :.

15. Determine the coecient of x8 in (x 1

3)(x 2)2

16. By the method of generating function solve the following recurrence relation
n
a +2 5an+1 + 6an = 2, n  0, a0 = 3 and a1 = 7.