(Combinatorics) (Week 4-5)

College of Arts and Sciences Education
General Education - Mathematics

2nd Floor, DPT Building, Matina Campus, Davao City
Phone No.: (082)300-5456/305-0647 Local 134
Week 4-5: Unit Learning Outcomes (ULO):

At the end of the unit, you are expected to:
a) Solve problems involving generating functions and the
Pigeonhole principle while applying the knowledge and skills you
have learned from Probability (BSM 315).
Big Picture in Focus
ULOa. Solve problems involving generating functions and the

Pigeonhole principle while applying the knowledge and skills
you have learned from Probability (BSM 315).
Metalanguage
In this section, the essential terms relevant to the study of generating functions
and the Pigeonhole principle and to demonstrate ULOa will be operationally defined to
establish a common frame of reference as to how the texts work. You will encounter
these terms as we go through the study of the nature of mathematics. Please refer to
these definitions in case you will encounter difficulty in understanding some concepts.
1. Generating Functions. Generating function is a way of encoding an infinite

sequence of numbers by treating them as the coefficients of a formal power series.
This series is called the generating function of the sequence.
2. Pigeonhole Principle. The pigeonhole principle states that if n items are put into m
containers, with n > m, then at least one container must contain more than one item.
Essential Knowledge
To perform the aforesaid big picture (unit learning outcomes) for the 4th and
5th weeks of the course, you need to fully understand the following essential
knowledge that will be laid down in the succeeding pages. Please note that you are
not limited to refer to these resources exclusively. Thus, you are expected to utilize
other books, research articles, and other resources that are available in the
university’s library e.g., ebrary, search.proquest.com, etc.
Phone No.: (082)300-5456/305-0647 Local 134
1
Phone No.: (082)300-5456/305-0647 Local 134
2
Phone No.: (082)300-5456/305-0647 Local 134
3
Phone No.: (082)300-5456/305-0647 Local 134
4
Phone No.: (082)300-5456/305-0647 Local 134
5
Phone No.: (082)300-5456/305-0647 Local 134
6
Phone No.: (082)300-5456/305-0647 Local 134
7
Phone No.: (082)300-5456/305-0647 Local 134
8
Phone No.: (082)300-5456/305-0647 Local 134
9
Phone No.: (082)300-5456/305-0647 Local 134
10
Phone No.: (082)300-5456/305-0647 Local 134
11
Phone No.: (082)300-5456/305-0647 Local 134
12
Phone No.: (082)300-5456/305-0647 Local 134
13
Phone No.: (082)300-5456/305-0647 Local 134
14
Phone No.: (082)300-5456/305-0647 Local 134
15
Phone No.: (082)300-5456/305-0647 Local 134
16
Phone No.: (082)300-5456/305-0647 Local 134
17
Phone No.: (082)300-5456/305-0647 Local 134
18
Phone No.: (082)300-5456/305-0647 Local 134
19
Phone No.: (082)300-5456/305-0647 Local 134
20
Phone No.: (082)300-5456/305-0647 Local 134
21
Phone No.: (082)300-5456/305-0647 Local 134
22
Phone No.: (082)300-5456/305-0647 Local 134
23
Phone No.: (082)300-5456/305-0647 Local 134
24
Phone No.: (082)300-5456/305-0647 Local 134
25
Phone No.: (082)300-5456/305-0647 Local 134
26
Phone No.: (082)300-5456/305-0647 Local 134
27
Phone No.: (082)300-5456/305-0647 Local 134
28
Phone No.: (082)300-5456/305-0647 Local 134
29
Phone No.: (082)300-5456/305-0647 Local 134
30
Phone No.: (082)300-5456/305-0647 Local 134
31
Phone No.: (082)300-5456/305-0647 Local 134
32
Phone No.: (082)300-5456/305-0647 Local 134
33
Phone No.: (082)300-5456/305-0647 Local 134
34
Phone No.: (082)300-5456/305-0647 Local 134
35
Phone No.: (082)300-5456/305-0647 Local 134
36
Phone No.: (082)300-5456/305-0647 Local 134
37
Phone No.: (082)300-5456/305-0647 Local 134
38
Phone No.: (082)300-5456/305-0647 Local 134
39
Phone No.: (082)300-5456/305-0647 Local 134
40
Phone No.: (082)300-5456/305-0647 Local 134
41
Phone No.: (082)300-5456/305-0647 Local 134
42
Phone No.: (082)300-5456/305-0647 Local 134
43
Phone No.: (082)300-5456/305-0647 Local 134
44
Phone No.: (082)300-5456/305-0647 Local 134
45
Phone No.: (082)300-5456/305-0647 Local 134
46
Phone No.: (082)300-5456/305-0647 Local 134
47
Phone No.: (082)300-5456/305-0647 Local 134
48
Phone No.: (082)300-5456/305-0647 Local 134
49
Phone No.: (082)300-5456/305-0647 Local 134
50
Phone No.: (082)300-5456/305-0647 Local 134
51
Phone No.: (082)300-5456/305-0647 Local 134
52
Phone No.: (082)300-5456/305-0647 Local 134
53
Phone No.: (082)300-5456/305-0647 Local 134
54
Phone No.: (082)300-5456/305-0647 Local 134
55
Phone No.: (082)300-5456/305-0647 Local 134
56
Phone No.: (082)300-5456/305-0647 Local 134
57
Phone No.: (082)300-5456/305-0647 Local 134
58
Phone No.: (082)300-5456/305-0647 Local 134
59
Phone No.: (082)300-5456/305-0647 Local 134
60
Phone No.: (082)300-5456/305-0647 Local 134
You can also refer to the sources below to help you

further understand the lesson:
 Rossi, R. (2018). Mathematical statistics: an introduction to likelihood-based

inference. John Wiley & Sons.
 3G E-learning (2018). Theory, practice and techniques in probability theory.

3G E-Learning.
61
Phone No.: (082)300-5456/305-0647 Local 134
Now that you recognize the most crucial concepts of the study. Answer the problems
completely and show all your solutions.
nFn


1. Evaluate the infinite series n 1 .
3n
2. Find a rational generating function for the sequence an  given by the recurrence
formula
a0  0, a1  1, an  5an1  6an2 , n  2
3. Prove that
4. Prove that if n >3, then the Catalan number Cn is not a prime.
5. Show that the number of partitions of n into summands none of which occurs
exactly once is the same as the number of partitions of n into summands none of
which is congruent to 1 or 5 modulo 6.
6. Let X  m . An algebra on X is a subset S of P(X) with the following properties:

I. X  S
II. A  S implies X  A  S
III. A  S and B  S imply A  B  S .
a) How many algebras on X are possible if X is labeled?

b) How many if X is unlabeled?
62
Phone No.: (082)300-5456/305-0647 Local 134
Solve each of the following problems completely. Show all your solutions.
1. Using the pigeonhole principle, show that some positive integral power of 17
ends in 0001 (base 10).
2. Let q be an odd integer greater than 1. Show that there is a positive integer n
such that 2n - 1 is a multiple of q.
3. Prove that n(2, d) = 2d + 1.
4. Prove that n(3, 3) > 18. In fact, n(3, 3) = 19.
5. Show that the theorem on the independence number and chromatic number of
a graph does not hold for infinite graphs.
6. Give an example of a partial order on mn elements with length m and width n.
7. Let a1 , , an , b , with all ai  1 . Show that the maximum number of sums

 n 
a1  a2   an in the open interval (b, b + 2) is   .
 
 n 2 
 
63
Phone No.: (082)300-5456/305-0647 Local 134
Activity 1. Based from the definition of the most essential terms and concepts in
the study of generating functions and the Pigeonhole principle and the
learning exercises that you have done, please feel free to write your
arguments or lessons learned below.
1.
2.
3.
64
Phone No.: (082)300-5456/305-0647 Local 134
Generating Polya’s Pigeonhole

Functions Theorem Principle
Partition Asymmetric Graph

Numbers Graphs Colorings
65

(Combinatorics) (Week 4-5)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

(Combinatorics) (Week 4-5)

Uploaded by

Copyright:

Available Formats

College of Arts and Sciences Education

General Education - Mathematics

Week 4-5: Unit Learning Outcomes (ULO):

Big Picture in Focus

ULOa. Solve problems involving generating functions and the

1. Generating Functions. Generating function is a way of encoding an infinite

You can also refer to the sources below to help you

 Rossi, R. (2018). Mathematical statistics: an introduction to likelihood-based

 3G E-learning (2018). Theory, practice and techniques in probability theory.

4. Prove that if n >3, then the Catalan number Cn is not a prime.

6. Let X  m . An algebra on X is a subset S of P(X) with the following properties:

a) How many algebras on X are possible if X is labeled?

3. Prove that n(2, d) = 2d + 1.

4. Prove that n(3, 3) > 18. In fact, n(3, 3) = 19.

6. Give an example of a partial order on mn elements with length m and width n.

7. Let a1 , , an , b , with all ai  1 . Show that the maximum number of sums

Generating Polya’s Pigeonhole

Partition Asymmetric Graph

You might also like