Scribd
Upload
27 views4 pages

Exerchap 3

Uploaded by

Can Parmaksızoğlu
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
27 views4 pages

Exerchap 3

Uploaded by

Can Parmaksızoğlu
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/ 4

EXERCISES CHAPTER 3.

In the following exercises it is best to leave binomial coefficients and factorials


as they are without computing them. In case an answer is given, then this
just serves as a way to check the answer, it does not mean that this is the
way the answer should be given.
1. In a student council consisting of 16 persons there are mathematics- and
computer science students, freshmen as well as sophomores. Every
group has four representatives in the council. The council appoints a
committee, consisting of 6 council members.
(a) In how many ways can this be done, if every group has to have at
least one representative in the committee? (Ans.: 4480)
(b) And in how many ways if every group has at most two representa-
tives in the committee? (Ans.: 4320)

2. Should one desire to expand the formula (a + b + c + d + e + f )120 how


many terms does one get? (A term consists of a monomial together
with its coefficient. Ans.: 234531275) What would be the coefficient of
a10 b60 c40 d2 e2 f 6 in this hypothetical expansion? (Ans.: roughly 9.4 ×
1058 ).

3. One throws 10 dice simultaneously. One possible outcome is 3 ones, 1 two,


2 fours, 3 fives and 1 six. What is the number of possible outcomes?
(Ans.: 3003)

4. In this problem we investigate the number of ways to seat twelve persons


at a round table.
(a) What is the number of possibilities, if we consider seatings that
turn into each other after some rotation as equal.
(b) And what is the number, if in addition, we also consider seatings
that are mirror images of each other as equal?
(c) If there are two person out of these twelve, that definitely should
not sit next to each other, how many possibilities do we then have
(count mirror images as different, but rotated versions as equal).

5. 24 persons are going to have dinner at a round table. They either order
steak, or lobster. The restaurant has only 5 lobsters available, and for
technical reasons this dish is only prepared for two persons at a time,

1
who then also should sit next to each other.
(a) In how many ways can 10 lobster-eaters be selected from 24 per-
sons?
(b) In how many ways can these 10 lobster-eaters be divided in 5 or-
dered pairs?
(c) In how many ways can 14 steak-eaters and 5 ordered pairs of lobster-
eaters be seated at a round table. For an ordered pair of lobster-eaters,
the second should sit to the right of the first one. Rotated seatings are
considered equal.
(d) Finally argue that the total number of ways that the 24 people can
have dinner equals
24! 18!
.
14! 5!
Here it is assumed that exactly 10 persons order lobsters. Seatings that
are rotated versions of each other are considered equal, provided also
the dishes ordered are the same for every person.

6. (a) Prove by induction on n:


       
m m+1 m+n m+n+1
+ + ··· + = .
m m m m+1

(b) Obtain the same result by considering the coefficient of xn in

(1 + x)−1 (1 + x)−m−1 = (1 + x)−m−2 .

(c) Try to understand this result by considering a diagonal in Pascal’s


triangle.
(d) Try to find a combinatorial proof of this equality. In our case you
can count the number of elements of the following set: sequences that
consist of m + 1 ones and n zeros in any order. Subdivide this set in
subsets of sequences starting with 1 , 01 , 001 etc, respectively and
produce in this way a new proof for the equality in (a).

7. (a) Differentiate (1 + x)n , and then prove that


n  
X n
k = n · 2n−1 .
k=0
k

2
(b) Both sides of the equality in (a) can be seen as the total number
of ways to form a committee with a president, where the members,
including the president are chosen from a set of n persons. Show this,
and use this to give another proof of (a).

8. Give a combinatorial proof of the equality under (b) in exercise 11 of


Chapter 1, namely

f (k, n) = f (k, n − 1) + f (k − 1, n − 1) + · · · + f (1, n − 1)

for n ≥ 1 k ≥ 0, where f (k, n) stands for the number of ways of painting


n eggs with k colors.

9. A certain alphabet has 23 letters. Which percentage of the 6-letter words


consisting of letters from this alphabet has 6 different letters? (Ans.:
roughly 49.1%)

10. How many words are there consisting of


(a) at most three letters?
(b) three mutually different letters?
(c) five letters, with one that occurs exactly three times? (Ans.:
162500)
In this problem the alphabet has 26 letters.

11. How many divisors, including 1 and en 10!, does (10!) have? (Ans.: 270)

12. In the country of Abura the license plate of a car consist of 3 different
digits and 2 different letters in arbitrary succession. But if the digit
0 occurs then the letter O is not allowed and the other way around.
So AA123, 037OP, JB007 don’t occur, but, TH805, H05T8, 1H2O3
and Z82Y1 can occur, and are all different. After how many cars does
Abura need a different system? (Ans.: 4572000)

13. A student has 1 book shelf, 20 comic books, among them 3 pairs of dou-
bles, 5 books on computers, 4 dictionaries, and 2 books about discrete
mathematics. In how many ways can the student order these books on
the shelf, in such a way that books in the same category are together?
Orderings where two ‘equal’ book are interchanged, are considered the
same, but interchanging two different books from the same category
gives a different ordering. (Ans.: roughly 4.2 × 1022 )

3
14. How many 6-letter words can be made from the letters of
ssssssttttttooooookkkkkkeeeeeerrrrrr (six of each) and how many 36-
letter words, and how many 36-letter words that read the same from
left to right as from right to left? If there are only 5 letters of each
kind, how many 6-letters words can be made? And how many 30 letter
words that read the same from left to right as from right to left?

15. (a) Give a computation that shows that there are 700 necklaces with 6
beads, assuming there are (enough) white, red, yellow and blue beads.
(b) Let k be the product of two (different) primes, p and q. Give a
formula for the number of necklaces with n colors and k beads.

You might also like