(Combinatorics) (Week 1-3)

UNIVERSITY OF MINDANAO
College of Arts and Sciences Education

Bachelor of Science in Mathematics
Physically Distanced but Academically Engaged
Self-Instructional Manual (SIM) for Self-Directed Learning (SDL)
Course/Subject: BSM 411 – Combinatorics
Name of Teacher: Prof. Louie Resti S. Rellon
Prepared by: Prof. Louie Resti S. Rellon
THIS SIM/SDL MANUAL IS A DRAFT VERSION

ONLY; NOT FOR REPRODUCTION AND
DISTRIBUTION OUTSIDE OF ITS INTENDED
USE. THIS IS INTENDED ONLY FOR THE USE OF
THE STUDENTS WHO ARE OFFICIALLY
ENROLLED IN THE COURSE/SUBJECT. EXPECT
REVISIONS OF THE MANUAL. NOT FOR
REPRODUCTION AND COMMERCIAL USE.
General Education - Mathematics
2nd Floor, DPT Building, Matina Campus, Davao City
Phone No.: (082)300-5456/305-0647 Local 134
Course Outline: BSM 411 – Combinatorics
Course Coordinator: Louie Resti S. Rellon

Email: louie_rellon@umindanao.edu.ph
Student Consultation: Thru text message, BB chatroom, and email
Mobile 0919-581-1549/0905-229-5966
Phone: (082)300-5456 / 305-0647 Local 149
Effectivity Date: June 2020
Mode of Delivery: Blended (On-line with face-to-face or virtual
sessions)
Time Frame: 54 Hours
Student Workload: Expected Self-Directing Learning
Pre-requisite: BSM 315(Probability)
Co-requisite: None
Credit: 3 units
Attendance Requirement: A minimum of 95% attendance is required at all
scheduled Virtual or face to face sessions
Course Outline Policy
Areas of Concern Details

Contact and Non- This 3-unit course self-instructional manual is designed for
contact Hours blended learning mode of instructional delivery with
scheduled face to face or virtual sessions. The expected
number of hours will be 54, including the face to face or
virtual sessions. The face to face sessions shall include the
summative assessment tasks (exams) if warranted.
Assessment Task Submission of assessment tasks shall be on the 3rd, 5th, 7th,
Submission and 9th weeks of the term. The assessment paper shall be
attached with a cover page indicating the title of the
assessment task (if the task is a performance), the name
of the course coordinator, date of submission, and the
name of the student. The document should be emailed to
the course coordinator. It is also expected that you already
paid your tuition and other fees before the submission of
the assessment task. If the assessment task is done in real-
time through the features in the Blackboard Learning
Management System, the schedule shall be arranged
ahead of time by the course coordinator.
Turnitin Submission To ensure honesty and authenticity, all assessment tasks
(if necessary) are required to be submitted through Turnitin with a
maximum similarity index of 30% allowed. This means that
if your paper goes beyond 30%, the students will either opt
to redo her/his paper or explain in writing addressed to the
1
Phone No.: (082)300-5456/305-0647 Local 134
course coordinator the reasons for the similarity. In addition,

if the paper has reached more than 30% similarity index,
the student may be called for disciplinary action following
with the University’s OPM on Intellectual and Academic
Honesty. Please note that academic dishonesty such as
cheating and commissioning other students or people to
complete the task for you have severe punishments
(reprimand, warning, expulsion).
Penalties for Late The score for an assessment item submitted after the
Assignments/ designated time on the due date, without an approved
Assessments extension of time, will be reduced by 5% of the possible
maximum score for that assessment item for each day or
part-day that the assessment item is late. However, if the
late submission of the assessment paper has a valid
reason, a letter of explanation should be submitted and
approved by the course coordinator. If necessary, you will
also be required to present/attach pieces of evidence.
Return of Assessment tasks will be returned to you two (2) weeks
Assignments/ after the submission. This will be returned by email or via
Assessments the Blackboard portal. For group assessment tasks, the
course coordinator will require some or few of the students
for online or virtual sessions to ask clarificatory questions to
validate the originality of the assessment task submitted
and to ensure that all the group members are involved.
Assignment You should request in writing addressed to the course
Resubmission coordinator his/her intention to resubmit an assessment
task. The resubmission is premised on the student’s failure
to comply with the similarity index and other reasonable
grounds such as academic literacy standards or other
reasonable circumstances e.g., illness, accident, or
financial constraints.
Re-marking of You should request in writing addressed to the program
Assessment coordinator your intention to appeal or contest the score
Papers and Appeal given to an assessment task. The letter should explicitly
explain the reasons/points to contest the grade. The
program coordinator shall communicate with the students
on the approval and disapproval of the request. If
disapproved by the course coordinator, you can elevate
your case to the program head or the dean with the original
letter of request. The final decision will come from the dean
of the college.
Grading System All culled from BlackBoard sessions and traditional contact
Course discussions/exercises – 40%
1st formative assessment – 10%
2nd formative assessment – 10%
3rd formative assessment – 10%
All culled from on-campus/onsite sessions (TBA):

Final exam – 30%
2
Phone No.: (082)300-5456/305-0647 Local 134
Submission of the final grades shall follow the usual

University system and procedures.
Preferred Referencing
Use the 7th Edition of the APA Publication Manual
Style
Student You are required to create a umindanao email account,
Communication which is a requirement to access the BlackBoard portal.
Then, the course coordinator shall enroll the students to
have access to the materials and resources of the course.
All communication formats: chat, submission of assessment
tasks, requests, etc. shall be through the portal and other
university recognized platforms. You can also meet the
course coordinator in person through the scheduled face to
face sessions to raise your issues and concerns. For
students who have not created their student email, please
contact the course coordinator or program head.
Contact Details of the Dr. Khristine Marie D. Concepcion
Dean Email:khristinemarie_concepcion@umindanao.edu.ph
Phone: (082)300-5456/305-0647 Local 134
Contact Details of the Ronnie O. Alejan
Program Email: ronnie_alejan@umindanao.edu.ph
Head Phone: (082)300-5456/305-0647 Local 149
Students with Special Students with special needs shall communicate with the
Needs course coordinator about the nature of his or her special
needs. Depending on the nature of the need, the course
coordinator, with the approval of the program coordinator,
may provide alternative assessment tasks or extension of
the deadline for submission of assessment tasks. However,
the alternative assessment tasks should still be in the
service of achieving the desired course learning outcomes.
Instructional Help Dr. Khristine Marie D. Concepcion - Dean
Desk Email:khristinemarie_concepcion@umindanao.edu.ph
Contact Details Phone: (082)300-5456/305-0647 Local 134
Rosyl S. Matin-ao – College LMS Facilitator
Email: rosyl_matinao@umindanao.edu.ph
Phone: (082)300-5456/305-0647 Local 149
Library Contact Details Brigida E. Bacani
Email: brigida_bacani@umindanao.edu.ph
Phone: 300-5456 local 143
Well-being Welfare Zerdszen P. Rañises– GSTC Facilitator
Support Held Email: gstcmain@umindanao.edu.ph
Desk Contact Details Phone: 09778058911
3
Phone No.: (082)300-5456/305-0647 Local 134
Course Information: see/download course syllabus in the Blackboard LMS
Welcome to the course BSM 411 Combinatorics.
Combinatorics is usually considered as a branch of discrete

CC’s Voice: mathematics in which the main problem is that of counting the
number of ways of arranging or choosing objects from a finite set
according to some simple specified rules. Thus the root of the
problem, is mainly that of enumeration. But if the prescribed rules
and constraints become complicated the question to ask naturally is
whether an arrangement satisfying the given requirements exists in
the first place. In some cases these arrangements have to meet
certain optimality criteria, in which case we seek an optimal solution
of the problem. A typical statement in some of these optimal solutions
will assert that the minimum for one kind of a selection will
correspond to the maximum for another kind, yielding a maximum
minimum problem.
Combinatorial mathematics has a variety of applications. It is utilized

in physical and social sciences, for example, chemistry, computer
science, operations research, and statistics. Consequently, there has
recently been a rapid growth in the depth and breadth of the field of
combinatorics. The subject is becoming an increasingly important
component of the curriculum.
This course is an introduction to the three main branches of

combinatorics: enumeration, existence, and construction. It covers
CO basic counting methods, generating functions, the Pigeonhole
principle, Ramsey theory, error-correcting codes, and combinatorial
designs.
4
Phone No.: (082)300-5456/305-0647 Local 134
Week 1-3: Unit Learning Outcomes (ULO):

At the end of the unit, you are expected to:
a) Demonstrate an understanding of the basic counting methods
and apply the knowledge and skills you have learned from
Probability (BSM 315).
Big Picture in Focus
ULOa. Demonstrate an understanding of the basic counting methods

and apply the knowledge and skills you have learned from
Probability (BSM 315).
Metalanguage
In this section, the essential terms relevant to the study of basic counting
methods and to demonstrate ULOa will be operationally defined to establish a common
frame of reference as to how the texts work. Please refer to these definitions in case
you will encounter difficulty in understanding some concepts.
1. Multiplication Principle. In combinatorics, the rule of product or multiplication

principle is a basic counting principle. Stated simply, it is intuitive the idea that if
there are a ways of doing something and b ways of doing another thing, then there
are a · b ways of performing both actions.
2. Permutation. A permutation of a set is, loosely speaking, an arrangement of its

members into a sequence or linear order, or if the set is already ordered, a
rearrangement of its elements. The word "permutation" also refers to the act or
process of changing the linear order of an ordered set.
3. Combination. A combination is a selection of items from a collection, such that the

order of selection does not matter.
4. Binomial Coefficient. Binomial coefficients are the positive integers that occur as
coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by
a pair of integers n ≥ k ≥ 0.
5. Binomial Distribution. The binomial distribution with parameters n and p is the

discrete probability distribution of the number of successes in a sequence of n
independent experiments, each asking a yes–no question, and each with its own
Boolean-valued outcome: success or failure.
5
Phone No.: (082)300-5456/305-0647 Local 134
Essential Knowledge
To perform the aforesaid big picture (unit learning outcomes) for 1st to 3rd
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.
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
You can also refer to the sources below to help you

further understand the lesson:
 Mendenhall, W., Beaver, R. & Beaver, B. (2020). Introduction to probability

and statistics (5th ed.). Cengage learning.
 3G E-Learning (2019). Statistical theory. 3G E-Learning.
48
Phone No.: (082)300-5456/305-0647 Local 134
Now that you know the most essential concepts of the study. Answer each of the
following problems and show all your solution completely.
1. A person making a book display wants to showcase a novel, a history book,

and a travel guide. There are four choices for the novel, two choices for the
history book, and 10 choices for the travel guide. How many choices are
possible for the three books?
2. Let X = {1,2,3,..., 2n}. How many functions from X to X are there such that
each even number is mapped to an even number and each odd number is
mapped to an odd number?
3. A couple plans to visit three selected cities in Germany, followed by four

selected cities in France, followed by five selected cities in Spain. In how
many ways can the couple order their itinerary?
4. Give the expansion of (a + b)10.
5. What is the coefficient of x3y7 in the expansion of (x + y + l)20?
6. Prove the following identities:

 n  n  n  1
a)     
 k  k  k  1
 n  k  n  k  1
b)     1  
k   k 
7. You can order a pizza with up to four toppings (repetitions allowed) from a set
of 12 toppings. The order of the toppings is unimportant. How many different
pizzas can you order?
49
Phone No.: (082)300-5456/305-0647 Local 134
Answer the following questions completely by showing all your solutions.
1. (a) Find a formula for the number of surjective (onto) functions, T(m, n),
from {1,2,3,.. .,m} to {1,2,3,.. .,n} , where m > n.
n 
(b) Find a formula for the Stirling number of the second kind   .
k 
2. What polynomial produces the sequence
1, 4, 13, 34, 73, 136,...?
3. Prove the identity
F1   Fn  Fn 2  1, n  0
4. Let {an} be defined by the recurrence
a0  0, a1  1, an  5an1  6an2 , n  2 .
Find an explicit formula for an .
5. Show that the recurrence relations for the Stirling numbers of the first and
second kinds (allowing for negative values of the arguments) are equivalent.
6. How many 0's occur at the right of 1000!?
n
7. Prove that   is divisible by n if gcd(n, k) = 1.
k 
50
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 basic counting methods and the learning exercises that you
have done, please feel free to write your arguments or lessons learned
below.
1.
2.
3.
51
Phone No.: (082)300-5456/305-0647 Local 134
Binomial Recurrence
Permutations Theorem Relations
Combinations Fibonacci Counting and

Numbers Number Theory
52

(Combinatorics) (Week 1-3)

Uploaded by

Document Information

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 1-3)

Uploaded by

Copyright:

Available Formats

UNIVERSITY OF MINDANAO

College of Arts and Sciences Education

Physically Distanced but Academically Engaged

Self-Instructional Manual (SIM) for Self-Directed Learning (SDL)

Course/Subject: BSM 411 – Combinatorics

Name of Teacher: Prof. Louie Resti S. Rellon

Prepared by: Prof. Louie Resti S. Rellon

THIS SIM/SDL MANUAL IS A DRAFT VERSION

Course Outline: BSM 411 – Combinatorics

Course Coordinator: Louie Resti S. Rellon

Course Outline Policy

Areas of Concern Details

course coordinator the reasons for the similarity. In addition,

All culled from on-campus/onsite sessions (TBA):

Submission of the final grades shall follow the usual

Course Information: see/download course syllabus in the Blackboard LMS

Welcome to the course BSM 411 Combinatorics.

Combinatorics is usually considered as a branch of discrete

Combinatorial mathematics has a variety of applications. It is utilized

This course is an introduction to the three main branches of

Week 1-3: Unit Learning Outcomes (ULO):

Big Picture in Focus

ULOa. Demonstrate an understanding of the basic counting methods

1. Multiplication Principle. In combinatorics, the rule of product or multiplication

2. Permutation. A permutation of a set is, loosely speaking, an arrangement of its

3. Combination. A combination is a selection of items from a collection, such that the

5. Binomial Distribution. The binomial distribution with parameters n and p is the

You can also refer to the sources below to help you

 Mendenhall, W., Beaver, R. & Beaver, B. (2020). Introduction to probability

 3G E-Learning (2019). Statistical theory. 3G E-Learning.

1. A person making a book display wants to showcase a novel, a history book,

3. A couple plans to visit three selected cities in Germany, followed by four

4. Give the expansion of (a + b)10.

5. What is the coefficient of x3y7 in the expansion of (x + y + l)20?

6. Prove the following identities:

Answer the following questions completely by showing all your solutions.

2. What polynomial produces the sequence

1, 4, 13, 34, 73, 136,...?

3. Prove the identity

4. Let {an} be defined by the recurrence

6. How many 0's occur at the right of 1000!?

Combinations Fibonacci Counting and

You might also like