Mindanao State University Iligan Institute of Technology

Iligan City, Lanao del Norte

______________________________________________________________________________
Danilo O. Jacobe
1st Sem., 2015-2016
Math 470 Combinatorial Mathematics
Mary Ann Ritzell Vega, PhD.
______________________________________________________________________________

Problem Set
1. Exercise 1 #64
Given r , n N with r n, let L(r , n) denote the number of ways of distributing r distinct
objects into n identical boxes so that no box is empty and the objects in each box are
arranged in a row. Find L(r , n) in terms of r and n.
Solution:
Recall:

Step1:

Result in Case 2 (iii) of the Distribution Problem, i.e., the number of ways of
distributing r identical objects into n distinct boxes, r n, such that no box is empty is
r 1

*
n 1
First assume that we are
r n, so that no box is

distributing r identical objects into n distinct boxes,

empty, i.e.,
ways.

Step2: Since the objects must be distinct and the objects in each box are arranged in a row, so
arrangement matters. So, we have to multiply by r!.
Step3:

Since the boxes must be

from the counting. So we have

identical, then its arrangement must be removed

to divide by n!.

Therefore, the desired number of ways is given by L(r , n)

Danilo O. Jacobe | Math 470 - Combinatorics

r! r 1

.
n! n 1

2. Exercise 2 #11
Find the number of permutations of the multi-set {m1, n2}, where m, n N, which must
contain the m 1s.

Solution:
Let M ={m1, n2}be a multi-set of m n objects. Suppose that A is the set of
permutations of M such that A must contain the m 1s. Then the number of ways to form A is
m r
, where r 0, 1, 2, ... , n . Thus, we have the following cases:
given by
r
m
Case 0: When r 0 , we have permutations.
0
m 1
permutations.
Case 1: When r 1 , we have
1
m 2
permutations.
Case 2: When r 2 , we have
2

m n
permutations.
Case n : When r n , we have
n

Hence, by (AP), we have

n
m r m m 1 m 2
m n


...

A
r
0
1
2
n
r 0

.
m n 1
(By Chu Shih - Chieh' s Identity)

n

Danilo O. Jacobe | Math 470 - Combinatorics

3. Exercise 2 #20
Give the combinatorial proof of the identity
n m n n r

.
m r r m r

Proof:
The identity becomes clear when we think of committees and subcommittees. Suppose
that we have a Student Body with n members, and out from these members we are to select a
committee containing m members, and finally out from these committee of m members we are to
select a subcommittee with r members, where r m n . The question now is in how many
ways we can do that?
The question can be answered by the left-hand side of our identity. That is,
we have two steps to arrive that:
n
Step 1: Select m-member committee from n-member Student Body, i.e., ways.
m
m
Step 2: Select r -member subcommittee from m- member committee, i.e., ways.
r
n m
Thus, by (MP), we have ways.
m r

But the same question can be answered by the right-hand side of our identity but in different
way, that is, also in two steps:
Step 1: Select the an r member subcommittee from the n -member Student Body, i.e.,
n
ways.
r
Step 2: To complete the committee into m-member committee, we are to select the remaining
m r members from among the remaining n r members of the Student Body, i.e.,
nr

ways.
m r
n n r
ways.
Thus, by (MP), we have
r m r
Hence, the identity is true.

Danilo O. Jacobe | Math 470 - Combinatorics

4. Exercise 2 #73
1

n
Given an , n N , show that lim an 2 .
n
k 0 k
n

Proof:
1

n
n
n
n
n
n
n


an ...
k 0 k
0
1
2
n 2
n 1
n
n

1 n

n(n 1)
n(n 1)
1

...

n 1

2
2

2 1
1 2

...

1
n n(n 1)
n(n 1) n

Then,

1 2
2 1
lim a n lim 1
...

n 1
n
n
n
n
(
n

1
)
n
(
n

1
)

2
2
1
1
lim (1) lim lim
... lim
lim lim (1)

n
n n
n n( n 1)
n n(n 1)

n n n
1 0 0 ... 0 0 1
2

n!

n!
n!
n!
1

...

(n 1)!1!
(n 2)!2!
2!(n 2)!
1!(n 1)!
1

Danilo O. Jacobe | Math 470 - Combinatorics