DISCRETE MATHEMATICS

COUNTING METHODS

COUNTING METHODS
is also referred to as COMBINATORICS. basically concerned with problems of counting as to many ways an event can be done.

COUNTING METHODS
Multiplication Rule Addition Rule Permutation Combination

MULTIPLICATION RULE
If an activity can be constructed in t successive steps and step 1 can be done in 1 ways, step 2 in 2 ways, and step t can be done in ways, then the number of different possible activities is

1 2 3
Example: How many ways can we choose a dinner from 5 types of appetizers, 3 types of meat and 4 types of beverages.

ADDITION RULE
Suppose 1 , 2 , , are mutually exclusive sets containing 1 , 2 , , elements, respectively, then the number of elements that their union contained is the sum of all their cardinalities, i.e.,

= 1 + 2 + +

Example: In how many ways can we choose a dinner from 5 types of appetizers, 3 types of meat and 4 types of beverages if the meat is either chicken or beef.

1. How many dinners are available from Bens Quick Diner consisting of one main course and an optional beverage?
main course hamburger, cheeseburger, steak.

beverages tea, cola, coffee.

2. How many strings of length 4 can be formed using the letters ABCDE if repetitions is allowed? If the string must begin with letter B? if the string do not begin with letter B?

3. How many eight-bit string begin with either 101 or 111? 4. In how many ways can we select two books of different subjects among five distinct CS books, three distinct Math books and two distinct Art books. 5. A six person committee composed of Ariel, Ben, Connie, Diane, Ernie and Fe is to select a chairperson, secretary and treasurer.
(a) In how many ways can this be done? (b) if Ariel or Ben is to sit as chairperson. (c) if Ernie must hold one of the office.

PERMUTATION
A permutation of n elements is an ordering of n elements. This can be done in ! ways.

Example: How many ways can we arranged 5 persons in a row?

PERMUTATION
An r - permutation of n elements is an ordering of r elements from a collection of n elements and is given by ! , = ! Example: How many ways can we select a president, secretary and treasurer from a committee of six persons.

1. How many ways can we arrange the letters ABCDEF? if it must contain the substring DEF?

2. How many ways can a group of six person sit on a circular table? If two of them should sit together?

In how many ways can 6 people be seated in a row of 6 chairs?

A bus has 3 vacant seats. If five additional passengers enter the bus, in how many different ways can they be seated?

Eight children are to take seats at a round table. How many ways can they be arranged?

How many four-letter words beginning and ending with a vowel without any repetition can be formed from the word PERSONNEL

Five different math books, 4 different electronics books, and 2 different communications books are to be placed in a shelf with the books of the same subject together. Find the number of ways in which the book can be placed? What is the number of permutation of the letters in the word BANANA. Four different colored flags can be hung in a row to makes a coded signal. How many signals if a signal consists of the display of one or more flags?

In how many ways can 4 boys and 4 girls be seated on a row of 8 seats? In how many ways can 5 boys and 5 girls be seated in the arrangement: a. No girl is in between two boys b. A girl is in between two boys

COMBINATION
An r - combination of n elements is an unordered selection of r elements from a collection of n elements and is given by ! , = ! ! Example: How many ways can we select a committee of two women and three men from a group of five women and six men.

1. How many eight-bit strings contain exactly four 1s? 2. How many routes can be done from the lower left corner of an n x n square grid to the upper right corner if we are restricted to travel only to the right or upward?

Definition:
Suppose that a sequence S of n items has 1 identical items of type 1, 2 identical items of type 2, , and identical items of type t, then the number of orderings of S is ! 1 ! 2 ! !
where = 1 + 2 + +

1. In how many ways can eight distinct books be divided among three students if Bill gets four books and Shizio and Maruo each gets two books? 2. How any arrangements can be done on the word MISSISSIPPI? 3. Consider three types of books: a computer science book, a physics book and a history book. Suppose that the library has at least six copies for each of these books. In how many ways can we select six books?

An F4 fan has 8 posters to pin-up on the walls of the room, but there is space only for five, In how many ways can she choose the posters to be pinned up? In how many ways can you invite one or more of your six friends to a party? Find the total number of combinations of the letters JRT taken 1, 2, and 3 at a time. In how many ways can a committee of three consisting of 2 chemical engineers and one mechanical engineer can be formed from 4 ChE and 3ME.

In a mathematics examination, a student may select 7 problems from a set of 10 problems. In how many ways can he make his choices?
There are 13 teams in a tournament. Each team is to play with each other only one. What is the minimum number of days can they all play without any of them playing more than one game in a day? There are 5 main roads between the cities A and B and 4 C and B. In how many ways can a person drive from A to C and return going through B on both trips without driving the same road twice?

Theorem:
If is a set containing t elements, the number of unordered k-element selection from X, repetition is allowed, is
+ 1, 1 = ( + 1, )

1. Suppose there are piles of red, blue and green balls (of unlimited amount). In how many ways can we select eight balls? 2. In how many ways can 12 identical Mathematics books be distributed among students Anne, Beth, Celes and Dan?

BINOMIAL THEOREM
Consider
+

= + + +

When n = 3; + 3 = + + + . = + + + + + + + = 3 + 32 + 3 2 + 3 3 3 3 3 3 2 3 = + + 2 + 0 0 1 2

In general,

1 = + + 0 1 ++ 1 + 1 =
=0

2 2 .

1. Expand 3 2 4 using Binomial Theorem. 2. Find the coefficient of 5 4 in the expansion + 9 . 3. Find the coefficient of 2 3 4 in the expansion + + 9 . 4. What is the term containing 3 3 2 3 in the expansion 2 + 2 3 + 11 ?

PIGEONHOLE PRINCIPLE
If n pigeons fly into k pigeonholes, < , some pigeonholes will contain at least two pigeons.
Examples: 1. Thirteen people are in a room, explain why at least two of them have the same birth month. 2. Five microprocessors are interconnected. Show that at least two of them are connected to the same number of processors.