Mathematics 209.2 Second Semester A.Y.

2015–2016
Problem Set 3 M.J.C. Loquias

Write all your solutions, justifications, and answers on sheets of yellow pad.
Use only black or blue non-erasable ink. Work independently!
Due: 11 February 2016 (Thursday) 5:30 pm

1. How many ways are there to distribute four identical bananas and six lollipops (each a
different flavor) into five different boxes?

2. Find the number of shortest routes from O to P in the street network shown below if the
street AB is closed.

b
P

A b b
B

b
O

3. How many numbers greater than 4,000,000 can be formed by arrangements of 1, 3, 3, 7, 8, 8, 8?

4. Find the number of positive integer solutions to the equation

(x1 + x2 + x3 )(y1 + y2 + y3 + y4 ) = 77.

5. Let A = {1, 2, . . . , n}, where n ∈ N.

(a) Given k ∈ A, show that the number of subsets of A in which k is the maximum number
is given by 2k−1 .
P i
n−1
(b) Apply (a) to prove that 2 = 2n − 1.
i=0

*************