Name: NIM: Class:

Assignment CLO 2: Combinatorics

Discrete Mathematics (CII1G3/CPI1G3)
Second Term 2021-2022
Instructions:

1. This assignment is due Wednesday April 13, 2022 at 5:00 p.m.. Please submit your work to the
corresponding submission slot in LMS CeLOE. You need to submit a readable .pdf file of this assignment
to the provided submission slot in CeLOE. You can contact your class instructor for more detailed
information. Please make sure that your file size do not exceed the maximum file size allowed.

2. Please upload your assignment to the LMS CeLOE under the file name: A2-<student ID>.pdf,
for example: A2-1301218888.pdf.

3. You may submit this assignment in one the following form:

a. You print this assignment and write your answer using HB/2B pencil or pen with blue/black ink
(handwritten answer). You may add additional A4-sized papers. Afterwards you submit the scan/photograph
of this assignment.
b. You use a .pdf editing tools and write your answer directly using blue/black colored writing.
c. You copy the problem from this assignment to a text/word processing program and type your answer
neatly.
d. You rewrite the problem from this assignment in an A4-sized paper and submit the scan/photograph
of your work.

4. All problems in this assignment are adapted from the textbooks. The problems are written in English.
If you are a student in a regular class, you may answer the problems in Bahasa Indonesia. However,
if you are a student in international class, your answers must be written in English—otherwise your
assignment will not be graded. You may ask your class instructor or teaching assistant for helping you
understanding the problem, but you should not ask them to give the solution of any problem.

5. Be neat and write legibly. You will be graded not only on the correctness of your answers, but also on
the clarity with which you express them.

6. This assignment consists of 10 problems and each problem is worth 10 points.

7. Please retain yourself from copying answers from elsewhere without understanding the steps. Such an
attitude will not enhance your knowledge. This assignment is an individual evaluation.

8. Important: late submission without reasonable explanation will not be graded.

page 1 of 12
Problem 1 A palindromic number is a natural number whose reversal is identical to itself. For instance,
the numbers: 1, 99, 101, 2112, 44444 are respectively palindromic numbers of 1, 2, 3, 4, and 5 digits.
How many integers between 1000 and 1000 000 that are not palindromic? (Some examples of these non-
palindromic numbers are 1234, 98 788, and 321 124.) Express your result as an integer.

A NSWER :

page 2 of 12
Name: NIM: Class:

Problem 2 Personal identification numbers (PINs) of a bank account consist of six decimal digits where
each digit is a decimal number between 0 to 9 (inclusive). Determine the number of different PINs start with
99 or end with 00 but not both. (Examples of these PINs are 991234 and 123400, but the string 991200 is
not included because it starts with 99 and end with 00). Express your answer as an integer.

A NSWER :

page 3 of 12
Problem 3 Determine the number of integers between 1 and 1000 000 000 000 (inclusive) that are divisible
by 6, 9, 15 or 20. Some examples of these integers are: 6, 9, 12, 15, 18, 20, 24, 27, 30, 36, 40, 42, 45, 48,
54, and 60. You may use Python to help you finding the answer. Express your answer as an integer.

A NSWER :

page 4 of 12
Name: NIM: Class:

Problem 4 Bojongsoang University has four faculties, i.e.: Faculty of Engineering, Faculty of Arts and
Design, Faculty of Economics, and Faculty of Law. Faculty of Engineering and Faculty of Economics
consist of seven majors each, while Faculty of Arts and Design and Faculty of Law have four majors each.
In the admission year of 2021, each major in the Faculty of Engineering and Faculty of Arts and Design
admitted 100 students, while every major under the Faculty of Economics and Faculty of Law admitted 150
students.

(a). [5 points] Determine the total number of students registered to Bojongsoang University in the admis-
sion year of 2021. Express your answer as an integer!

(b). [5 points] What is the minimum number of students required to ensure that four of them enrolled in
the same major? Express your answer as an integer!

A NSWER :

page 5 of 12
Problem 5 In 1990s, valid landline telephone numbers in Arlington are of the form

Y X1 X2 X3 X4 X5 X6 ,

where the first three digits form the area code, Y represents a digit from 2 to 9 (inclusive), and Xi for each
1 i 6 represents any digit from 0 to 9 (inclusive). In addition, the digit Xi for 3 i 6 cannot be all
zero. Some examples of valid telephone numbers are: 250 1234, 700 0101, and 321 1000; whereas
020 1234, 110 0001, and 234 0000 are examples of invalid telephone numbers.

(a). [5 points] How many possible valid telephone numbers are there? Express your result as an integer!

(b). [5 points] What is the least number of people required to guarantee that at least four of them use
identical landline telephone numbers? Express your result as an integer!

A NSWER :

page 6 of 12
Name: NIM: Class:

Problem 6 Six students, Alice, Bob, Carlos, David, Emma, and Fiona are going to the cinema. There are
ten seats remaining: B1, B2, B3, . . . , B10.

(a). [5 points] Suppose Alice insists to sit on B1 while Bob insists to sit on B10. How many different
seating arrangements are there? Express your result as an integer.

(b). [5 points] Suppose Fiona must not be seated on B9. How many different seatings arrangements are
there? (Hint: firstly, consider the case when Fiona must be seated on B9.) Express your result as an
integer.

A NSWER :

page 7 of 12
Problem 7 Telkom Bakery produces breads of different flavors, namely chocolate, cheese, mocha, cinna-
mon, strawberry, raisin, and peanut.

(a). [5 points] At the end of this month, Telkom Bakery plans to sell a special package of breads con-
taining five different flavors. Determine the number of different special packages that can be sold.
Provide your answer as an integer.
(Examples: package 1: chocolate, cheese, mocha, cinnamon, strawberry; package 2: chocolate,
mocha, strawberry, raisin, peanut; package 3: cheese, mocha, cinnamon, strawberry, peanut.)

(b). [5 points] Based on the previous month sale, chocolate bread has always been a favorite. There-
fore, the manager decide that every special package in (a) must contain chocolate bread. Determine
the number of different special packages we can sell if the packages must contain chocolate bread.
Provide your answer as an integer.
(Examples: package 1: chocolate, cheese, mocha, cinnamon, strawberry; package 2: chocolate,
mocha, strawberry, raisin, peanut; package 3: chocolate, cinnamon, strawberry, raisin, peanut.)

A NSWER :

page 8 of 12
Name: NIM: Class:

Problem 8 The competitive programming club in a university has twenty-five members, five of them are
the former medalists of the national informatics olympiad. How many ways are there to make a team of
four students if:

(a). [5 points] the team consists of exactly two former medalists? Express your result as an integer.

(b). [5 points] the team consists of at least one former medalist? Express your result as an integer.

A NSWER :

page 9 of 12
Problem 9 How many different strings can be made from the word MILLIMICRON when all letters are
used and such strings do not contain the substring RON? (examples: MILLIMICORN, MILLIMICONR,
RILLIMICMON, etc.) Express your result as an integer.

A NSWER :

page 10 of 12
Name: NIM: Class:

Problem 10 Peter Rabbit, his cousin Benjamin, and his triplet sisters Flopsy, Mopsy, and Cottontail, spend
most of their days stealing vegetables from Mr. McGregor garden. One day, Peter stole twenty-five carrots
and wanted to distribute them to his cousin and his sisters.

(a). [5 points] How many ways are there to divide twenty-five carrots among five rabbits (i.e., Peter,
Benjamin, and his sisters) if each of them gets at least two carrots? Express your result as an
integer. Some admissible distributions are:
Peter: 10 carrots, Benjamin: 9 carrots, Flopsy: 2 carrots, Mopsy: 2 carrots, Cottontail: 2 carrots;
Peter: 6 carrots, Benjamin: 6 carrots, Flopsy: 6 carrots, Mopsy: 4 carrots, Cottontail: 3 carrots;
Peter: 7 carrots, Benjamin: 6 carrots, Flopsy: 5 carrots, Mopsy: 4 carrots, Cottontail: 3 carrots;
Peter: 3 carrots, Benjamin: 4 carrots, Flopsy: 5 carrots, Mopsy: 6 carrots, Cottontail: 7 carrots;
Peter: 5 carrots, Benjamin: 5 carrots, Flopsy: 5 carrots, Mopsy: 5 carrots, Cottontail: 5 carrots.
A NSWER :

page 11 of 12
 (b). [5 points] How many ways are there to divide twenty-five carrots among five rabbits if each of them
gets at least two carrots but Benjamin gets at most five carrots? Express your result as an integer.
Some admissible distributions are:
Peter: 3 carrots, Benjamin: 4 carrots, Flopsy: 5 carrots, Mopsy: 6 carrots, Cottontail: 7 carrots;
Peter: 5 carrots, Benjamin: 5 carrots, Flopsy: 5 carrots, Mopsy: 5 carrots, Cottontail: 5 carrots.
(The first, second, and the third examples in part (a) cannot be used because Benjamin gets more than
five carrots.)
A NSWER :

page 12 of 12