Indian Statistical Institute

M.Tech. (CS) First Year (2016-2017)

Discrete Mathematics
Assignment 2
Due on August 26, 2016

1. Let a be a discrete numeric function such that ar is equal to the remainder when the
integer r is divided by 17. Let b be a discrete numeric function such that br is equal
to 0 if the integer r is divisible by 3, and is equal to 1 otherwise.
(a) Let cr = ar + br . For what values of r is cr = (i) 0, (ii) 1?
(b) Let dr = ar br . For what values of r is d = (i) 0, (ii) 1?
2. Determine the ordinary generating function for the numeric function a where ar = 2r
if r is even, and 2r otherwise.
3. Determine the discrete numeric functions corresponding to the generating functions:
2
7x2
(a) G(x) = (1+x)
(1x)4 ; (b) A(x) = (12x)(1+3x) .
4. A set of r marbles is selected from an infinite supply of red, blue, white and yellow
marbles. A selection must satisfy the condition that either the number of red marbles
is even and the number of blue marbles is odd, or the number of white marbles is even
and the number of yellow marbles is odd. Let ar denote the total number of such
selections. Determine the generating function A(x) and find a closed form expression
for ar . Evaluate the expression for r = 23.
5. (optional) Show that the number of nonzero terms in the expansion of the nth-order
determinant having 0s in the main diagonal and 1s elsewhere is same as the number
of derangements of an n-element set.
6. Suppose there are p types of objects with ni indistinguishable objects of type i, for i =
1, 2, . . . , p. Give the exponential generating function for the number of distinguishable
permutations of length k.
7. Solve the recurrence: an = 6an1 12an2 + 8an3 , given that a0 = 0, a1 = 1, a2 = 1.
What are the possible solutions if the boundary conditions are unknown?

8. Triangular pyramidal nubers Tn (also known as tetrahedral numbers) are positive

integers that can be represented by triangular pyramidal shapes. The first four such
numbers are 1, 4, 10, 20.

Figure 1: Triangular Pyramidal Numbers

9. Find the general form of a particular solution of the Linear Non-Homogeneous Recurrence Relation with Constant Coecients
ar = c1 ar1 + c2 ar2 + + ck ark + n2n
.
10. Give asymptotic upper and lower bounds for T (n) in the following recurrences:

(a) T (n) = 7T (n/3)+n2 ; (b) T (n) = nT ( n)+n; and (c) T (n) = 3T (n/2)+n log n.