Scribd
Upload
680 views3 pages

Combinatorics Questions

combinatorics questions

Uploaded by

Pratyush Mishra
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
680 views3 pages

Combinatorics Questions

combinatorics questions

Uploaded by

Pratyush Mishra
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/ 3

Problem Set for the NPTEL Course

COMBINATORICS
Module 1: Pigeon Hole Principle
1. (a) Show that if n +1 integers are chosen from the set {1, 2, . . . , 2n} then
there are always two which dier by 1.
(b) Show that if n +1 integers are chosen from the set {1, 2, . . . , 3n} then
there are always two which dier by at most 2.
(c) Generalise the above 2 statements.
2. Use the pigeon hole principle to prove that the decimal expansion of a
rational number m/n eventually is repeating.
3. Prove that any 5 points chosen within a square of side length 2, there are
2 whose distance apart is at most

2.
4. There are 100 people at a party. Each person has an even number (possibly
0) of aquaintances. Prove that there are 3 people at the party with the
same number of aquaintances.
5. Prove that in a graph of n vertices, where n 6, there exists either a
triangle (i.e. a complete subgraph on 3 vertices) or an independent set on
3 vertices.
Module 2: Elementary Concepts and Basic Counting Principles
1. Prove that the number of permutations of m As and at most n Bs equals

m + n + 1
m + 1

2. Consider the multiset {n.a, 1, 2, . . . , n} of size 2n. Determine the number


of its n-combinations.
3. Consider the multiset {n.a, n.b, 1, 2, . . . , n + 1} of size 3n + 1. Determine
the number of n-combinations.
4. Establish a bijection between the permutations of the set {1, 2, . . . , n} and
the towers of the form A
0
A
1
A
n
, where |A
k
| = k for k = 0, 1, . . . , n.
5. A city has n junctions. It is decided that some of them will get trac
lights, and some of those that get trac lights will also get a gas station.
If at least one gas station comes up, then in howmany dierent ways can
this happen ?
1
Module 3: More Strategies
1. Find the number of integers between 1 and 10,000 which are neither pefect
squares nor perfect cubes.
2. Determine the number of 12-combinations of the multi-set S = {4.a, 3.b, 4.c, 5.d}.
3. Determine a general formula for the number of permutations of the set
{1, 2, . . . , n} in which exactly k integers are in their natural positions.
4. Use a combinatorial reasoning to derive the identity:
n! =

n
i=0

n
i

D
ni
, where D
i
is the number of permutations of {1, 2, . . . , i}
such that no number is in its natural position. (D
0
is dened to be 1. )
5. Find the number of permutations of a, b, c . . . , x, y, z in which none of the
patterns spin, game, path, and net occurs.
Module 4: Recurrence Relations and Generating Functions
1. Prove that the Fibonacci sequence is the solution of the recurrence relation
a
n
= 5a
n4
+ 3a
n5
, n 5
where a
0
= 0, a
1
= 1, a
2
= 1, a
3
= 2 and a
4
= 3. Then use this formula to
show that the Fibonacci numbers satisfy the condition that f
n
(the n-th
Fibonacci number = a
n
) is divisible by 5 if and only if n is divisible by 5.
2. Consider a 1-by-n chess board. Suppose we color each square of the chess
board with one of 3 colors, red, green and blue so that no two squares
that are colored red are adjacent. Let h
n
be the number of such colorings
possible. Find and verify a recurrence relation that h
n
satises. Then nd
a formula for h
n
.
3. Solve the recurrence relation h
n
= h
n1
+ 9h
n2
9h
n3
, n 3 with
initial values h
0
= 0, h
1
= 1, h
2
= 2.
4. Solve the non-homogenious recurrence relation h
n
= 4h
n1
+ 3.2
n
, n 1
with initial value, h
0
= 1.
5. Let h
n
be the number of ways to color the squares of a 1-by-n chess board
with the colors red, white, blue, and green in such a way that the number
of squares colored red is even and the number of squares colored white
is odd. Determine the exponential generating function for the sequence
h
0
, h
1
, h
2
, . . . , and then nd a simple formula for h
n
.
Module 5: Special Numbers
1. Let 2n (equally spaced) points on a circle be chosen. Show that the number
of ways to join these points in pairs, so that the resulting n line segments
do not intersect, equals the nth Catalan number.
2
2. Consider the Sterling Number of the second kind, S(n, k). Show that
S(n, n 2) =

n
3

+ 3.

n
4

.
3. The number of partitions of a set of n elements into k distinguishable
boxes (some of which may be empty) is k
n
. By counting in a dierent
way, prove that
k
n
=
n

i=1

k
i

i!S(n, i)
If k > n, dene S(n, k) = 0.
4. For each integer n > 2, determine a self-conjugate partition of n that has
at least two parts.
5. Consider Sterling number of the rst kind, s(n, k). Show that

n
i=0
s(n, i) =
n!
6. Let t
1
, t
2
, . . . , t
m
be distinct positive integers, and let q
n
= q
n
(t
1
, t
2
, . . . , t
n
)
equal the number of partitions of n in which all parts are taken from
t
1
, t
2
, . . . , t
m
. Dene q
0
= 1. Show that the generating function for the
sequence q
0
, q
1
, q
2
, . . . , is

m
k=1
(1 x
t
k
)
1
.
3

You might also like