Scribd
Upload
16 views2 pages

Discrete Mathematics, Tutorial VI: A, A, ..., A A, A N A A J,, ..., K

Uploaded by

roy080506
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
16 views2 pages

Discrete Mathematics, Tutorial VI: A, A, ..., A A, A N A A J,, ..., K

Uploaded by

roy080506
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

Discrete Mathematics, Tutorial VI

1. (a) Find a recurrence relation for the number of strictly increasing sequences of positive integers that have 1 as their first
term and n as their last term, where n is a positive integer. That is, sequences a1 , a2 , ..., ak , where a1 = 1, ak = n, and
aj < aj+1 for j = 1, 2, ..., k − 1.
(b) What are the initial conditions?
(c) How many sequences of the type described in (a) are there when n is an integer with n ≥ 2?

2. (a) Find a recurrence relation for the number of bit strings of length n that contain three consecutive 0s.
(b) What are the initial conditions?
(c) How many bit strings of length seven contain three consecutive 0s?
3. (a) Find a recurrence relation for the number of bit strings of length n that contain the string 01.
(b) What are the initial conditions?
(c) How many bit strings of length seven contain the string 01?
4. A string that contains only 0s, 1s, and 2s is called a ternary string.
(a) Find a recurrence relation for the number of ternary strings of length n that contain two consecutive symbols that are
the same.
(b) What are the initial conditions?
(c) How many ternary strings of length six contain consecutive symbols that are the same?
5. Let T(m, n) denote the number of onto functions from a set with m elements to a set with n elements. Show that T(m, n)
satisfies the recurrence relation
n−1
T (m, n) = nm −
P
C(n, k)T (m, k)
k=1
whenever m ≥ n and n > 1, with the initial condition T (m, 1) = 1.
6. (a) Let S(n, k) denote the number of ways of partitioning n distinct elements into k disjoint non-empty subsets. Give a
combinatorial proof that S(n, k) = S(n − 1, k − 1) + kS(n − 1, k).
(b) What will be the value of S(n + 1, n) ?
 2  
Pn n 2n − 1
7. Give a combinatorial proof that k=1 k =n .
k n−1
8. Let (xi , yi ), i = 1, 2, 3, 4, 5, be a set of five distinct points with integer coordinates in the xy plane. Show that the midpoint
of the line joining at least one pair of these points has integer coordinates.
9. (a) Show that if five integers are selected from the first eight positive integers, there must be a pair of these integers with a
sum equal to 9.
(b) Is the conclusion in part (a) true if four integers are selected rather than five?
10. Show that for every integer n there is a multiple of n that has only 0s and 1s in its decimal expansion.
11. Show that every sequence of n2 + 1 distinct real numbers contains a subsequence of length n + 1 that is either strictly
increasing or strictly decreasing.
12. There are 9 people, aged from 18 to 58, at a family reunion. Show by pigeonhole principle that it is possible to choose two
disjoint groups of these people in such a way that the sums of the ages of the people in each group are equal.

1
13. Let A = {1, 2, . . . , 2n} and let B ⊂ A be any subset of A, such that |B| = n + 1. Using pigeon-hole principle, show that
there exists two integers ai , aj ∈ B, such that either ai divides aj or aj divides ai .

14. How many solutions are there to the equation


x1 + x2 + x3 + x4 + x5 + x6 = 29,
where xi , i = 1, 2, 3, 4, 5, 6, is a non-negative integer such that
(a) xi > 1 for i = 1, 2, 3, 4, 5, 6?
(b) x1 ≥ 1, x2 ≥ 2, x3 ≥ 3, x4 ≥ 4, x5 > 5, and x6 ≥ 6?
(c) x1 ≤ 5?
(d) x1 < 8 and x2 > 8?

You might also like