Scribd
Upload
11 views2 pages

Tutorial Sheet 5

Uploaded by

Abdul Haleem Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Tutorial Sheet 5

Uploaded by

Abdul Haleem Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MTL180: Discrete Mathematical Structures

Tutorial Sheet 5 (2024)

1. A quality controller has to visit one factory a day. In the next 8 days, she will
visit each of 4 factories, A, B, C, and D, twice. The controller is free to choose the
order in which she visits these factories, but the two visits to factory A cannot be
on consecutive days. In how may different orders can the controller proceed ?
2. (a) How many configurations are there for 8 non-attacking rooks on an 8 × 8 chess
board?
(b) If all the rooks are colored differently?
(c) If there are 1 red rook, 2 blue rooks and 4 yellow rooks?
3. a) How many ways can we distribute 10 identical balls in three distinct boxes with
infinite capacity? b) How many ways can we distribute 10 identical balls in three
distinct boxes with capacities 3,4 and 5, respectively?
4. Six married couples are to be seated at a circular table. In how many ways can
they arrange themselves so that no wife sits next to her husband?
5. What is the number of integral solutions of the equation:
x1 + x2 + x3 + x4 = 18 that satisfy 1 ≤ x1 ≤ 5; −2 ≤ x2 ≤ 4; 0 ≤ x3 ≤ 5; 3 ≤ x4 ≤ 9?
6. In a certain area of the country side are 5 villages. An engineer is to devise a system
of 2 way roads so that after the system is completed no village will be isolated. In
how many ways can he do this ?
7. Determine the number of solutions of the equation x1 + x2 + x3 + x4 = 14 in positive
integers x1 , x2 , x3 and x4 not exceeding 5.
8. At a party, seven gentlemen check their hats. In how many ways can their hats be
returned so that
(a) no gentleman receives his own hat?
(b) at least one of the gentlemen receives his own hat?
(c) at least two of the gentlemen receive their own hats?
9. In how many ways can the integers 1,2,3,. . .,n be arranged in a line so that none of
the patterns 12, 23, 34, . . . , (n − 1)n occurs?
10. In how many ways can Mr ABC distribute ten distinct books to his ten children
(one book to each child) and then collect and redistribute the books so that each
child has the opportunity to peruse two different books?
11. For A = {1, 2, 3, 4, 5} and B = {u, v, w, x, y, z}, determine the number of one-to-one
functions f : A → B where f (1) ̸= v, w; f (2) ̸= u, w;f (3) ̸= x; and f (4) ̸= v, x, y.
12. Find the solution of the recurrence with given initial values:
i) an+1 = an + 12an−1 ,n ≥ 2; a0 = 1, a1 = 4.
ii) hn = 4hn−1 + 4n , n ≥ 1; ho = 3.
iii) hn = 4hn−1 − 4hn−2 + 3n + 1, n ≥ 2; ho = 1, h1 = 2.

13. How many binary strings of length n are there that contain no two consecutive 1s?
√
14. Solve the recurrence relation an+2 = an+1 an with initial conditions a0 = 2, a1 = 8.

15. Solve the recurrence relation hn = (n + 2)hn−1 with initial value ho = 2.

16. Suppose you deposit 500 INR in a bank account that pays 6% interest at the end
of each year (compounded annually). Thereafter, at the beginning of each year you
deposit 100 INR. Let hn be the amount in your account after n years (so ho = 500).
Determine the generating function g(X) = ho + h1 x + ... + hn xn + . . . and then a
formula for hn .

17. Let hn denote the number of ways to perfectly cover a 1-by-n board with monomi-
noes and dominoes in such a way that no two dominoes are consecutive. Find a
recurrence relation and initial conditions satisfied by hn .

18. Let 2n (equally spaced) points on a circle be chosen. Let Cn be the number of ways
to join these points in pairs, so that the resulting n line segments do not intersect.
Find a formula for Cn .

You might also like