LM Discrete Math W1

CRT LEARNING MODULE
Course Code MS101
Course Title Discrete Mathematics and Discrete Structure
Units 3
Module Title Introduction to Discrete Mathematics and Discrete

Structures.
Document No. 001-2020

DISCRETE Date Developed:
MATHEMATICS July 1, 2020
AND DISCRETE Date Revised:
Issued by:
STRUCTURE July 16, 2020
Page 1
Module 1: Introduction Developed by:
CRT
to discrete mathematics JECCY MAE B. SABADO
and structure
College for Research & Technology of Cabanatuan
HOW TO USE THIS DIGITIZED LEARNING MODULE?
Welcome to the module in Introduction to Discrete mathematics and Discrete
Structures. This module contains training materials and activities for you to complete
this module.
The Unit of Competency “Discrete Mathematics and Discrete

Structures” covers the knowledge, skills and attitudes required as part of the
competencies to complete.
You are required to go through a series of learning activities in order to

complete each learning outcome of the module. Each of the learning outcomes is
provided with Modules. Follow these activities on your own and answer the self-
check at the end of each learning outcome. You may remove a blank answer sheet
at the end of each module (or get the answer sheets from the online facilitator) to
write the answers for each self-check. If you have questions, don’t hesitate to ask
your facilitator for assistance.
This module was prepared to help you achieve all the requirements.
 Talk to your online facilitator and agree on how you will both organize the
Training of this unit. Read each through the module carefully. It is divided
into sections, which cover all the skills and knowledge you need to
successfully complete this module.
 Work through all the information and complete the activities in each section.
Read Modules and complete self-check. Suggested references are included to
supplement the materials provided in this module.
 Most probably your facilitator will be your supervisor or manager. Your online
facilitator will support and correct you.
 Your online facilitator will tell you about the important things you need
consider when you are completing activities and it is important that you listen
and take notes.

Issued by:
Page 2
CRT
and structure
 You will be given plenty of opportunity to ask questions and practice on the
job. Make sure you practice new skills during regular work shifts. This way
you will improve both your speed and memory and also your confidence.
 Talk to more experienced workmates and ask for their guidance.
 Kindly the self-check questions at the LMS (EDMODO) to test your own
progress.
 When you are ready, ask your online facilitator to watch you online via Zoom
or Google Meet to perform the activities outlined in this module.
 Ask your online facilitator work through the activities: ask for written feedback
on your progress. Your online facilitator keeps feedback/pre-assessment
reports for this reason. When you have successfully completed each element,
ask the facilitator to mark on the reports that you are ready for assessment.
 When you have completed this module, and feel confident that you have
sufficient practice, your online facilitator will arrange an appointment with
registered assessor’s to assess you. The results of your assessment will be
recorded in your competency Achievement Record.
DISCRETE MATHEMATICS AND DISCRETE STRUCTURE
Contents of this Learning Module
No. Module Title Topic Code
1 Introduction to Factorials Module 1.1-1a

Discrete
Mathematics and Combinations
Discrete Module 1.1-1b
Structures Permutations
Binomial Module 1.2
Theorem

Issued by:
Page 3
CRT
and structure
MODULE CONTENT
MODULE TITLE : Introduction to Discrete

Mathematics and Structures
MODULE DESCRIPTOR:
This module covers the knowledge, skills, and attitudes in solving a different
problem.
Number of Hours:
6hours
LEARNING OUTCOMES:
At the end of this module you MUST be able to:
1. Solve counting problems using factorials
2. Expand powers of a binomial by Pascal's Triangle and by binomial coefficients

Issued by:
Page 4
CRT
and structure
LEARNING OUTCOME # 1: Solve counting problems using
factorials
Contents:
1. Factorials
* Combinations
* Permutations
2. Binomial Theorem
Conditions
The students/trainees must be provided with the following:
1. Calculator
2. Paper
3. Pencil
4. Eraser
5. Ballpen
Assessment Method:
1. Written Examination
2. Problem Solving
Learning Activities (Study Guide)

1. Using EDMODO/Vsmart app on your phone or the website on your laptop, go to
the Discrete Mathematics and Discrete Structure class.
2. Click on the FOLDERS section (on menu bar)
3. Click the folder MODULE 1: Discrete Mathematics and Discrete Structures. The
digitized Modules, Task Sheets and Job Sheets are available in this folder.

Issued by:
Page 5
CRT
and structure
4. All the Self-Checks are contained in the folder MY ACTIVITIES.
Learning Activities Special Instructions
1. Read Module No. 1.1-1 Contained in the Module 1: Binomial Theorem in

(Introduction for Discrete VSmart/Edmodo(Module 1.1-1)
Mathematics and Discrete
Structure)
2. Answer self-check for 1.1-1 The self-checks are available thru the folder
SELF CHECKS. The activity is timed (15
minutes). The results will be immediately be
available after clicking SUBMIT and the system
will run through the items incorrectly answered
(and show the solution)

Issued by:
Page 6
CRT
and structure
MODULE 1.1-1
Introduction to Discrete mathematics and Discrete Structures
Learning Objective: After reading this MODULE, you should be able

to:
1. Know the definition of Factorials
2. Explain the formula how to solve a problem using a factorial
3. Familiar the different types and function of calculator
4. Expand powers of a binomial by Pascal's Triangle and by
binomial coefficients
5. Compute factorial values.
6. Compute binomial coefficients by formula.
INTRODUCTION:
Discrete Mathematics and Structure is concerned with function and
relationships which are defined only for the positive integer.
Factorial(!)- if n is a positive integer, n factorial denoted by n! is a product
of all positive integers less than or equal to n. it is defined by
n!= n(n-1)(n-2)……… 2(1)
as special case 0!=1
The mathematical expression for this sort of counting i.e counting the # of ways to
arrange six objects without replacement is factorial six.
The symbol used is 6!

In general for any positive integer n,
n!=nx(n-1)x(n-2)x………x(1)
Note that 0! Is defined to be 1 and 1! Defined to be 1.
On the ‘Casio f(x)-82LB fraction calculator the factorial key is the back function on
the memory recall key. “Make sure you cand find the factorial key on your
calculator”.

Issued by:
Page 7
CRT
and structure
When dealing with problems which involve counting you must use common sense.
Often very simple mathematics is all that required.
 How many different six digits’ telephone numbers are there? (assume zero,
cannot occupy the first position).
Your estimate?.........
Answer:
One way of doing this is to recognize that we are dealing with permutations
and replacement is allowed.
No. of ways of selecting first digit = 9

{1,2,3,4,5,6,7,8 or 9}
No. of ways of selecting second digit

No. of ways of selecting sixth digits
=total # of permutation= 9x10x10x10x10x10

=9x105=900 000

Issued by:
Page 8
CRT
and structure
Factorial Key
X ! = x  (x – 1)
 (x – 2) …  (1
No. of
Permutations
Key nPr= n!/r! nP nC
r r
No. of combination
Key
nCr= n !/r!(n-r)!

Issued by:
Page 9
CRT
and structure
Example #2.) 4! Is shorthand for 4x3x2x1. The factorial function says to multiply
all whole # from our chosen number down to 1.
4!= 4x3x2x1=24
Calculating from the previous value we can easily calculate a factorial from previous
one.
X2 x3 x4 x5 x6
1 2 6 24 120 720
As a table:
N N!
1 1 1 1
2 2x1 2x1! 2
3 3x2x1 3x2! 6
4 4x3x2x1 4x3! 24
5 5x3x2x1 5x4! 120
6 Etc. Etc.
 To work out 6! Multiply 120 by 6 to get 720.

 To work out 7! Multiply 720 by 7 to get 5040.
 And so on.
Example #3.) 9! Equal 362,880. Try to calculate 10!
10! =10x9!
Issued by:
Page 10
CRT
and structure
10! = 10x362,880= 362,800
So rule is
N!=n x (n-1)!
Which says “the factorial of any # is that # times the factorial of (that #
minus 1)”.
So 10! =10x (10-1)

10!= 10 x 9!
10 x 1! = 10
10 x 2! = 20
10 x 3! = 60
10 x 4! = 240
10 x 5! = 1200
10 x 6! = 7200
10 x 7! = 50,400
10 x 2! = 403,200
10 x 9! = 362,800
Combination- A combination is a grouping or subset of items for a

combination, the order does not matter.
C(n.r) = nCr = N!/(n-r)!r!
N= # of items in set.
R= # of items selected from the sets/ # of repetition.
Example #1. How many committees of 3 can be formed from a group of 4

students ?

Issued by:
Page 11
CRT
and structure
This combination and can be written as C(4,3) or 4C3 or 4
3
4C
3= 4 = 4!/3!(4-3)!= 4x3x2x1/(3x2x1) x (1x1) =?
3
In general the # of possible combination of n objects taken r at a time

without nreplacement is nCr = n/r = n!/ (r!) (n-r)!
So 4C3= 4 = 4!/3!(4-3)!= 4x3x2x1/(3x2x1) x (1x1) = 24/6 = 4

3
Example #2. There are 12 students in Mrs. Wrights’s Class. She wants to choose 3
students to clean the cafeteria tables. How many ways you can she choose three
students.
12C =
3 12 = 12! /3!(12-3)!=12!/3!/9!
3
The students will use their calculator to find the answer.
12C =
3 12 = 479,001,600/6 (362,880)
3
= 479,001,600/ 2,177,280= 220 ways
Permutations= are the different ways in which collection of items can be arranged.
P(n,r)= n!/(n-r)

Issued by:
Page 12
CRT
and structure
Consider again five objects from which there are to be selected but this time the
order is important. If no replacement is allowed there are 5 ways of filling position
1.: 4 ways of filling position 2.: and 3 ways of filling position.
i.e. 5x4x3= 60 different ways.

The total number of different ways when order of selection is important called the
number of permutations of 5 things taken 3 at a time when order is important is
written as 5p3.
5p =
3 5!/(5-3)! = 5x4x3x2x1/2x1 = 60
And in general, the number of permutation of n objects taken are at a time without
replacement is nPr = n!/(n-r)!. find the “Pr key on your calculator. It is back Function
on the 1 digit on the casio”.
Example. In how many ways can a president, a treasurer and a secretary be chosen
from among 7 candidation.
Solution: Using reasoning for the first position there are 7 posible choices. After
that candidate is chosen there are 6 posible choices finally there are 5 finally
choices.
7x6x5=210
Using permutation formula, the problem involves 7 candidates taken 3 at a time .
P(7,3)= 7!/(7-3)! = 7!/4!= 7x6x5x4/4!

= 5040/24
= 210 ways.
Example 2: Gomer is choosing and arranging a subject of a elements from a seat
of 20 elements. So, we can get the answer quickly by using the permutation
formula. Letting n=20 and r=9 (that is the answer to this problem) the number of
permutation of 20 things taken at a time.
Issued by:
Page 13
CRT
and structure
P(20,9) = 20!/(20-9)!= 20!/11!
= 60,949,324,800.0842

Issued by:
Page 14
CRT
and structure
SELF CHECK 1.1
Problem Solving: Solve the following using your calculator , your answer will send
it to my email : sabadojeccymae@gmail.com.( you have a 30 mins. To solve it)
1. In how many ways can a coach choose three swimmers from among five
summers.
2. Compute the 12!
3. Find the value of :
a. 14C
5
10
b. C8
c. P(7,2)
LEARNING OUTCOME # 2: Expand powers of binomial by

Pascal’s Triangle and by binomial coefficients.
Contents:
Issued by:
Page 15
CRT
and structure
1. Factorials
* Combinations
* Permutations
2. Binomial Theorem
Conditions
The students/trainees must be provided with the following:
6. Calculator
7. Paper
8. Pencil
9. Eraser
10. Ballpen
Assessment Method:
3. Written Examination
4. Problem Solving
Learning Activities (Study Guide)

1. Using EDMODO/Vsmart app on your phone or the website on your laptop, go to
the Discrete Mathematics and Discrete Structure class.
2. Click on the FOLDERS section (on menu bar)
3. Click the folder MODULE 1: Discrete Mathematics and Discrete Structures. The
digitized Modules, Task Sheets and Job Sheets are available in this folder.
4. All the Self-Checks are contained in the folder MY ACTIVITIES.
Learning Activities Special Instructions

Issued by:
Page 16
CRT
and structure
3. Read Module No. 1.1-1 Contained in the Module 1: Introduction to
(Introduction for Discrete Discrete Mathematics and Discrete Structure in
VSmart(Module 1.1-1)
Mathematics and Discrete
Structure)
4. Answer self-check for 1.1-1 The self-checks are available thru the folder
SELF CHECKS. The activity is timed (15
minutes). The results will be immediately be
available after clicking SUBMIT and the system
will run through the items incorrectly answered
(and show the solution)
MODULE 1.1-2
Binomial Theorem
INTRODUCTION:

Issued by:
Page 17
CRT
and structure
Now that you have mastered factorials and combinations we can
proceed to utilize them for expansions of algebraic expressions.
A binomial is a polynomial with two terms. We're going to look at the

Binomial Expansion Theorem, a shortcut method of raising a binomial to
a power.
When you look at the following expansions you can see the symmetry
and the emerging patterns. The simple first case dates back to Euclid in
the third century BCE.
(a +b) 2 = (a +b)(a +b)
= a 2 +2ab +b 2
(a +b) 3 = (a +b) 2 (a +b)

= (a 2 +2ab +b 2 )(a +b)
= (a 3 +2a 2 b + ab2 )+(a 2 b +2ab2 +b 3 )
= a 3 +3a 2 b +3ab2 +b
(a +b) 4 = (a +b) 3 (a +b)

= (a 3 +3a 2 b +3ab2 +b 3) (a +b)
= (a4 +3a 3 b +3a 2 b 2 + ab3)+(a 3 b +3a 2 b 2 +3ab3 +b 4 )
= a 4 +4a 3 b +6a 2 b 2 +4ab3 +b 4
Notice that
 the expansion of (a +b) 2 has three terms and in each term the
sum of the indices is 2
 the expansion of (a +b) 3 has four terms and in each term the
sum of the indices is 3
 the expansion of (a +b) 4 has five terms and in each term the
sum of the indices is 4.

Issued by:
Page 18
CRT
and structure
We conjecture that the expansion of (a +b) n has n +1 terms and in
each term the sum of the indices is n.
The coefficients of the terms follow an interesting pattern. How can

we determine this pattern and how can we predict the coefficients of
the expansion of (a +b) n ? The binomial theorem gives us the
general formula for the expansion of (a + b) n for any positive
integer n. It also enables us to determine the coefficient of any
particular term of an expansion of (a +b) n .
In this module, Pascal’s triangle is centre stage. The coefficients of

the expansion of (a +b) n , for a particular positive integer n, are
contained in sequence in the nth row of this triangle of numbers.
The triangular numbers, the square numbers and the numbers of the
Fibonacci sequence can be found from the triangle, and many
interesting identities can be established.
For example, the triangular numbers occur in Pascal’s triangle along
the diagonal shown in the following diagram. The square numbers
can be found by adding pairs of adjacent numbers on this diagonal.
1
1 1
1 2 1
1 3 3 1
Issued by:
Page 19
CRT
and structure
1 4 6 4 1
1 5 10 10
5 1
1 6 15 20 15 6 1
1 7 21 35 35 21
7 1
1 8 28 56 70 56 28 8 1
The triangular numbers in Pascal’s triangle.
This topic combines combinatory and algebraic results in a most productive manner.
The relationship between the expansion of (a + b)n and binomial

probabilities is ad- dressed in the module Binomial
distribution.
We begin by looking at the expansions of (1 + x)n for n = 0, 1, 2, 3, 4, 5.
(1 + x)0 = 1
(1 + x)1 = 1 + x
(1 + x)2 = 1 + 2x + x2
(1 + x)3 = 1 + 3x + 3x2 + x3
(1 + x)4 = 1 + 4x + 6x2 + 4x3 + x4
(1 + x)5 = 1 + 5x + 10x2 + 10x3 + 5x4 + x5
When the coefficients in the expansions of (1 + x)n are arranged in a table, the result is known as
Pascal’s triangle
Pascal’s triangle.
n x0 x1 x2 x3 x4 x5 x6 x7 x8
0 1 Document No. 001-2020
1 1 MATHEMATICS
1 July 1, 2020
Issued by:
2 1 2
STRUCTURE
1
July 16, 2020
Page 20
CRT
3 to discrete mathematics JECCY MAE B. SABADO
1 3
and structure 3 1
4 1 4 6 4 1
5 1 5 10 10 5 1
6 1 6 15 20 15 6 1
7 1 7 21 35 35 21 7 1
.
Pascal’s triangle is often displayed in the following way. Some of the patterns of the tri-
angle are more apparent in this form.
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1

Issued by:
Page 21
CRT
and structure
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
By examining Pascal’s triangle, we can make the following observations, which will be
proved later in this module.
1. Each number is the sum of the two numbers diagonally above it (with the
exception of the 1’s).
2. Each row is symmetric (i.e., the same backwards as forwards).
3. The sum of the numbers in each row is a power of 2.
4. In any row, the sum of the first, third, fifth, . . . numbers is equal to the sum of
the second, fourth, sixth, . . . numbers. (This is not a totally obvious result.)
We can use Pascal’s triangle to help us expand expressions of the form (1 + x)n .

Issued by:
Page 22
CRT
and structure
Example
Expand
2 (1 − 2x)6.
1 (1 + x)6
1Solution
Thecoefficients of(1+ x)6 aregiven in the sixthrowof Pascal’striangle: (1+ x)6 = 1 +
6x + 15x2 + 20x3 + 15x4 + 6x5 + x 6 .
2 The expansion of (1− 2x)6 can be obtained by replacing (−2x) for x in the expansion of (1+ x)6 :
(1− 2x)6 = 1+ 6(−2x) + 15(−2x)2 + 20(−2x)3 + 15(−2x)4 + 6(−2x)5 + (−2x)6
= 1 − 12x + 60x2 − 160x3 + 240x4 − 192x5 + 64x6.
.nΣ
Expansions and the notation
r
Expansions
We start by looking at the results of multiplying several binomials. With two binomials, we
have
(a + b)(c + d ) = a(c + d ) + b(c + d ) = ac + ad + bc + bd .

The expansion is obtained by multiplying each letter in the first bracket by each letter in
the second and adding them. There are 2 × 2 = 22 = 4 terms. Similarly, with three
binomials, we have
(a + b)(c + d )(e + f ) = ace + ac f + ade + ad f + bce + bc f + bde + bd f .

There are 2 × 2 × 2 = 23 = 8 terms.

Issued by:
Page 23
CRT
and structure
Example#2.
Find the coefficient of x2 in the expansion of (2x − 1)(3x + 4)(5x − 6).
Solution:
If we take the terms containing x from any two of the factors and the constant from
the remaining factor and multiply these terms together, we will obtain a term containing
x 2 in the expansion. If we do this in all possible ways and add, we will find the
required coefficient.
The required coefficient is
2 × 3 × (−6) + 3 × 5 × (−1) + 2 × 5 × 4 = −36 − 15 + 40
= −11.

Issued by:
Page 24
CRT
and structure
SELF CHECK 1.2
Problem Solving: Solve the following using your calculator , your answer will send
it to my email : sabadojeccymae@gmail.com.( you have a 30 mins. To solve it)
1. Expand (x2 + 3)6

2. Expand (2x – 5y)7
3. Find the tenth term in the expansion of (x + 3)12.
4. Express 1296x12 – 4320x9y2 + 5400x6y4 – 3000x3y6 + 625y8 in the
form (a + b)n

Issued by:
Page 25
CRT
and structure

LM Discrete Math W1

Uploaded by

Document Information

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

LM Discrete Math W1

Uploaded by

Copyright:

Available Formats

CRT LEARNING MODULE

Course Code MS101

Course Title Discrete Mathematics and Discrete Structure

Module Title Introduction to Discrete Mathematics and Discrete

Document No. 001-2020

The Unit of Competency “Discrete Mathematics and Discrete

You are required to go through a series of learning activities in order to

Document No. 001-2020

DISCRETE MATHEMATICS AND DISCRETE STRUCTURE

Contents of this Learning Module

No. Module Title Topic Code

1 Introduction to Factorials Module 1.1-1a

Document No. 001-2020

MODULE TITLE : Introduction to Discrete

Document No. 001-2020

Learning Activities (Study Guide)

Document No. 001-2020

Learning Activities Special Instructions

1. Read Module No. 1.1-1 Contained in the Module 1: Binomial Theorem in

Document No. 001-2020

Introduction to Discrete mathematics and Discrete Structures

Learning Objective: After reading this MODULE, you should be able

The symbol used is 6!

Note that 0! Is defined to be 1 and 1! Defined to be 1.

Document No. 001-2020

No. of ways of selecting first digit = 9

No. of ways of selecting second digit

=total # of permutation= 9x10x10x10x10x10

Document No. 001-2020

Document No. 001-2020

 To work out 6! Multiply 120 by 6 to get 720.

So 10! =10x (10-1)

Combination- A combination is a grouping or subset of items for a

C(n.r) = nCr = N!/(n-r)!r!

Example #1. How many committees of 3 can be formed from a group of 4

Document No. 001-2020

In general the # of possible combination of n objects taken r at a time

So 4C3= 4 = 4!/3!(4-3)!= 4x3x2x1/(3x2x1) x (1x1) = 24/6 = 4

The students will use their calculator to find the answer.

= 479,001,600/ 2,177,280= 220 ways

Document No. 001-2020

i.e. 5x4x3= 60 different ways.

Using permutation formula, the problem involves 7 candidates taken 3 at a time .

P(7,3)= 7!/(7-3)! = 7!/4!= 7x6x5x4/4!

Document No. 001-2020

LEARNING OUTCOME # 2: Expand powers of binomial by

Learning Activities (Study Guide)

4. All the Self-Checks are contained in the folder MY ACTIVITIES.

Learning Activities Special Instructions

Document No. 001-2020

Document No. 001-2020

A binomial is a polynomial with two terms. We're going to look at the

(a +b) 3 = (a +b) 2 (a +b)

(a +b) 4 = (a +b) 3 (a +b)

Document No. 001-2020

The coefficients of the terms follow an interesting pattern. How can

In this module, Pascal’s triangle is centre stage. The coefficients of

The relationship between the expansion of (a + b)n and binomial

We begin by looking at the expansions of (1 + x)n for n = 0, 1, 2, 3, 4, 5.

(1 + x)4 = 1 + 4x + 6x2 + 4x3 + x4

(1 + x)5 = 1 + 5x + 10x2 + 10x3 + 5x4 + x5

Document No. 001-2020

Document No. 001-2020

6x + 15x2 + 20x3 + 15x4 + 6x5 + x 6 .